4tx codebook enhancement in lte

ABSTRACT

Channel state information (CSI) feedback in a wireless communication system is disclosed. A precoding matrix is generated for multi-antenna transmission based on precoding matrix indicator (PMI) feedback, wherein the PMI indicates a choice of precoding matrix derived from a matrix multiplication of two matrices from a first codebook and a second codebook. In one embodiment, the first codebook comprises at least a first precoding matrix constructed with a first group of adjacent Discrete-Fourier-Transform (DFT) vectors. In another embodiment, the first codebook comprises at least a second precoding matrix constructed with a second group of uniformly distributed non-adjacent DFT vectors. In yet another embodiment, the first codebook comprises at least a first precoding matrix and a second precoding matrix, where said first precoding matrix is constructed with a first group of adjacent DFT vectors, and said second precoding matrix is constructed with a second group of uniformly distributed non-adjacent DFT vectors.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of the filing date of U.S. Provisional Patent Application No. 61/763,804, filed on Feb. 12, 2013; U.S. Provisional Patent Application No. 61/768,851, filed on Feb. 25, 2013; U.S. Provisional Patent Application No. 61/769,463, filed on Feb. 26, 2013; U.S. Provisional Patent Application No. 61/770,705, filed on Feb. 28, 2013; U.S. Provisional Patent Application No. 61/777,664, filed on Mar. 12, 2013; U.S. Provisional Patent Application No. 61/807,647, filed on Apr. 2, 2013; U.S. Provisional Patent Application No. 61/812,459, filed on Apr. 16, 2013; and U.S. Provisional Patent Application No. 61/817,657, filed on Apr. 30, 2013, all titled “4Tx Codebook Enhancement in Release 12,” the disclosures of which are hereby incorporated by reference herein in their entirety.

TECHNICAL FIELD

The technical field of this invention is wireless communication such as wireless telephony.

BACKGROUND

The present embodiments relate to wireless communication systems and, more particularly, to the precoding of Physical Downlink Shared Channel (PDSCH) data and dedicated reference signals with codebook-based feedback for multi-input multi-output (MIMO) transmissions.

With Orthogonal Frequency Division Multiplexing (OFDM), multiple symbols are transmitted on multiple carriers that are spaced apart to provide orthogonality. An OFDM modulator typically takes data symbols into a serial-to-parallel converter, and the output of the serial-to-parallel converter is considered as frequency domain data symbols. The frequency domain tones at either edge of the band may be set to zero and are called guard tones. These guard tones allow the OFDM signal to fit into an appropriate spectral mask. Some of the frequency domain tones are set to values which will be known at the receiver. Among these are Channel State Information Reference Signals (CSI-RS) and Dedicated or Demodulating Reference Signals (DMRS). These reference signals are useful for channel estimation at the receiver.

In multi-input multi-output (MIMO) communication systems with multiple transmit/receive antennas, the data transmission is performed via precoding. Here, precoding refers to a linear (matrix) transformation of L-stream data into P-stream where L denotes the number of layers (also termed the transmission rank) and P denotes the number of transmit antennas. With the use of dedicated (i.e. user-specific) DMRS, a transmitter, such as a base station or eNodeB (eNodeB), can perform precoding operations that are transparent to user equipment (UE) acting as receivers. It is beneficial for the base station to obtain a precoding matrix recommendation from the user equipment. This is particularly the case for frequency-division duplexing (FDD) where the uplink and downlink channels occupy different parts of the frequency bands, i.e. the uplink and downlink are not reciprocal. Hence, a codebook-based feedback from the UE to the eNodeB is preferred. To enable a codebook-based feedback, a precoding codebook needs to be designed.

The Long-Term Evolution (LTE) specification includes codebooks for 2-antenna, 4-antenna, and 8-antenna transmissions. While those codebooks are designed efficiently, the present inventors recognize that still further improvements in downlink (DL) spectral efficiency are possible. Accordingly, the preferred embodiments described below are directed toward these problems as well as improving upon the prior art.

SUMMARY

Systems and methods for channel state information (CSI) and precoding matrix indicator (PMI) feedback in a wireless communication system are disclosed. A precoding matrix is generated for multi-antenna transmission based on a precoding matrix indicator (PMI) feedback from at least one remote receiver wherein the PMI indicates a choice of precoding matrix derived from a matrix multiplication of two matrices from a first codebook and a second codebook. One or more layers of a data stream are precoded with the precoding matrix and transmitted to the remote receiver.

In one embodiment, a method of CSI feedback and transmitting data in a wireless communication system comprises receiving one or more precoding matrix indicator (PMI) signals from a remote transceiver. The PMI signals indicating a choice of a precoding matrix W. The system generates the precoding matrix W from a matrix multiplication of two matrices W₁ and W₂. Matrix W is termed the composite precoder. Matrix W1 targets wideband/long-term channel properties, and matrix W2 targets frequency-selective/short-term channel properties. Each of the components W1, W2 is assigned a codebook. Hence, two distinct codebooks are needed: C₁ and C₂. Matrix Wt is selected from a first codebook C₁ based on a first group of bits in the PMI signals, and matrix W₂ is selected from a second codebook C₂ based on a second group of bits in the PMI signals.

Proposed first and second codebooks C₁ and C₂ are defined below for different ranks and different PMI bit lengths.

In one embodiment, one or more layers of a data stream are precoded by multiplication with the precoding matrix W. The precoded layers in the data stream are then transmitted to the remote receiver.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other aspects of this invention are illustrated in the drawings, in which:

FIG. 1 illustrates an exemplary wireless telecommunications network.

FIG. 2 illustrates a uniform linear array (ULA) or four pairs of ULA elements.

FIG. 3 illustrates four pairs of cross-polarized arrays.

FIG. 4 illustrates an example in which a grid of beams is shifted by m=2 beams.

FIG. 5 illustrates an example of using a row selection vector to prune antenna pairs in an 8Tx array.

FIG. 6 illustrates the technique used in downlink LTE-Advanced (LTE-A).

FIG. 7 is a block diagram illustrating internal details of a mobile UE and an eNodeB in an exemplary network system.

DETAILED DESCRIPTION

The invention(s) now will be described more fully hereinafter with reference to the accompanying drawings. The invention(s) may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention(s) to a person of ordinary skill in the art. A person of ordinary skill in the art may be able to use the various embodiments of the invention(s).

FIG. 1 illustrates an exemplary wireless telecommunications network 100. Network 100 includes a plurality of base stations 101, 102 and 103. In operation, a telecommunications network necessarily includes many more base stations. Each base station 101, 102 and 103 (eNodeB) is operable over corresponding coverage areas 104, 105 and 106. Each base station's coverage area is further divided into cells. In the illustrated network, each base station's coverage area is divided into three cells 104 a-c, 105 a-c, 106 a-c. User equipment (UE) 107, such as telephone handset, is shown in Cell A 104 a. Cell A 104 a is within coverage area 104 of base station 101. Base station 101 transmits to and receives transmissions from UE 107. As UE 107 moves out of Cell A 104 a and into Cell B 105 b, UE 107 may be handed over to base station 102. Because UE 107 is synchronized with base station 101, UE 107 can employ non-synchronized random access to initiate handover to base station 102.

Non-synchronized UE 107 also employs non-synchronous random access to request allocation of uplink 108 time or frequency or code resources. If UE 107 has data ready for transmission, which may be traffic data, measurements report, tracking area update, UE 107 can transmit a random access signal on uplink 108. The random access signal notifies base station 101 that UE 107 requires uplink resources to transmit the UEs data. Base station 101 responds by transmitting to UE 107 via downlink 109, a message containing the parameters of the resources allocated for UE 107 uplink transmission along with a possible timing error correction. After receiving the resource allocation and a possible timing advance message transmitted on downlink 109 by base station 101, UE 107 optionally adjusts its transmit timing and transmits the data on uplink 108 employing the allotted resources during the prescribed time interval.

Base station 101 configures UE 107 for periodic uplink sounding reference signal (SRS) transmission. Base station 101 estimates uplink channel quality information (CSI) from the SRS transmission. The preferred embodiments of the present invention provide improved communication through precoded multi-antenna transmission with codebook-based feedback. In a cellular communication system, a UE is uniquely connected to and served by a single cellular base station or eNodeB at a given time. An example of such a system is the 3GPP LTE system, which includes the LTE-Advanced (LTE-A) system. With an increasing number of transmit antennas at the eNodeB, the task of designing an efficient codebook with desirable properties is challenging.

CSI consists of Channel Quality Indicator (CQI), precoding matrix indicator (PMI), precoding type indicator (PTI), and/or rank indication (RI). The time and frequency resources that can be used by the UE to report CSI are controlled by the eNodeB.

In one embodiment, a dual-stage codebook for CSI feedback is based on the product structure proposed in:

W=W ₁ W ₂  (1)

where W₁ targets wideband/long-term channel properties and W₂ targets frequency-selective/short-term channel properties. Each of the components W₁, W₂ is assigned a codebook. Hence, two distinct codebooks are needed: CB₁ and CB₂. W is termed the composite precoder. The choice of W₁ and W₂ are indicated via PMI₁ and PMI₂.

The following principles are enforced for codebook designs:

(1) Finite alphabet for W: each matrix element belongs to a finite set of values or constellation (e.g., M-PSK alphabet).

(2) Constant modulus for W: all elements in a precoding matrix have the same magnitude. This is important to facilitate power amplifier (PA) balance property in all scenarios. Note that constant modulus is a sufficient condition for PA balance, but not a necessary condition. However, enforcing constant modulus property tends to result in a simpler codebook design. Note also that while the precoding codebook (for feedback) conforms to the constant modulus property, this does not restrict the eNodeB from using non-constant modulus precoder. This is possible due to the use of UE-specific RS for demodulation.

(3) Nested property for W: every matrix/vector of rank-n is a sub-matrix of a rank-(n+1) precoding matrix, n=1, 2, . . . , N−1 where N is the maximum number of layers. While this property is desirable as it allows to reduce the complexity of PMI selection, it is not necessary to facilitate rank override if UE-specific RS is used.

(4) The associated feedback signaling overhead should be minimized. This is achieved by a balance between the overhead associated with W₁ (wideband, long-term) and W₂ (sub-band, short-term). Here, both the time (feedback rate) and frequency (feedback granularity) dimensions are important

-   -   (a) Blindly increasing the size of CB₁ (while reducing the size         of CB₂) does not guarantee reducing the overall feedback         overhead if a certain level of performance is expected. If the         codebook CB₁ is meant to cover a certain precoder sub-space with         a given spatial resolution, increasing the size of CB₁ demands         an increase in feedbacks signaling associated with W₁, both in         time and frequency. This is because CB₁ starts to capture         shorter-term channel properties, which are meant to be parts of         CB₂.     -   (b) To ensure that CB₁ does not need to be updated too         frequently (in time and frequency), CB₁ should capture long-term         channel properties such as the antenna setup and a range of         values of angle of departure (AoD) which are associated with         spatial correlation.     -   (c) The design should strive to keep the maximum overhead         associated with W₂/CB₂ the same as the Release 8 PMI overhead         (i.e., ≦4 bits).

(5) Unitary precoder for W: (the column vectors of a precoder matrix must be pair-wise orthogonal to one another), while not necessary, is a sufficient condition for maintaining constant average transmitted power. This constraint is also used in designing the codebook at least for some relevant ranks.

The design of a 4Tx codebook for LTE disclosed herein targets an enhancement for multi-user (MU) MIMO over the 4Tx codebook in LTE Release 8. Rather than redesigning the 4Tx codebook, the enhancements disclosed herein focus on enhancing the MU-MIMO performance because the LTE Release 8 4Tx codebook was already designed to offer competitive performance for single-user (SU) MIMO (while keeping MU-MIMO in mind with the support of 8 discrete Fourier transform (DFIT) vectors in the rank-1 codebook). Based on this consideration, the 4Tx enhancement focuses on rank-1 and at most rank-2 where MU-MIMO becomes relevant.

In terms of antenna setups, three setups may be considered:

-   -   two dual-polarized elements with λ/2 (half wavelength) spacing         between two elements,     -   two dual-polarized elements with 4λ (larger) spacing between two         elements, and     -   uniform linear array (ULA) with λ/2 (half wavelength) spacing.

The first and the second setups have the highest priority. Good performance should be ensured for dual (i.e., cross) polarized antenna arrays with both small and large spacing.

The antenna element indexing shown in FIGS. 2 and 3 is use enumerate the spatial channel coefficients H_(n,m), where n and m are the receiver and transmitter antenna indices, respectively. FIG. 2 illustrates a ULA or four pairs of ULA elements indexed 1-8. FIG. 3 illustrates four pairs of cross-polarized arrays. The indexing for the four pairs of cross-polarized antennas represents grouping two antennas with the same polarization, which tend to be more correlated. This is analogous to the indexing of 4 pairs of ULA in FIG. 2.

Proposed Codebook Structure

The following notation is used to define the codebooks below:

-   -   W: 4Tx feedback precoding matrix.     -   W₁: first feedback precoding matrix     -   W₂: second feedback precoding matrix     -   i₁: PMI Index of W₁     -   i₂: PMI index of W₂     -   N: maximum number of layers     -   N_(TXA): number of transmit antennas     -   I_(k): (k×k)-dimensional identity matrix

Following the guideline of using the same principle for 4Tx enhancement and 8Tx, the block diagonal grid-of-beam (GoB) structure is used. This structure is common between 4Tx and 8Tx.

W₁ and the associated codebook can be written as follows:

$\begin{matrix} {B = \begin{pmatrix} b_{0} & b_{1} & \ldots & b_{N - 1} \end{pmatrix}} & (2) \\ {{\lbrack B\rbrack_{{1 + m},{1 + n}} = ^{j\frac{2\pi \; {mn}}{N}}},{m = 0},1,\ldots \mspace{14mu},{{\frac{N_{TXA}}{2} - {1\mspace{11mu} n}} = 0},1,\ldots \mspace{14mu},{N - 1}} & (3) \\ {X^{(k)} \in \begin{Bmatrix} {\left. \begin{matrix} \left\lbrack b_{{({N_{b}k})}{modN}} \right. & b_{{({{N_{b}k} + 1})}{modN}} & \ldots & b_{{({{N_{b}k} + N_{b} - 1})}{modN}} \end{matrix} \right\rbrack \text{:}} \\ {{k = 0},1,\ldots \mspace{14mu},{\frac{N}{N_{b}} - 1}} \end{Bmatrix}} & (4) \\ {{W_{1}^{(k)} = \begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}},{C_{1} = \left\{ {W_{1}^{(0)},W_{1}^{(1)},W_{1}^{(2)},\ldots \mspace{14mu},W_{1}^{{({N/N_{b}})} - 1}} \right\}}} & (5) \end{matrix}$

Here, different W₁ matrices represent a partitioning (without overlap) in terms of beam angles:

-   -   W₁ is a block diagonal matrix of size X where X is a         (N_(TXA)/2)×Nb matrix. Nb denotes the number of adjacent         (N_(TXA)/2)-Tx DFT beams contained in X. Such a design is able         to synthesize N (N_(TXA)/2)-Tx DFT beams within each         polarization group. For a given N, the spatial oversampling         factor is essentially (N/2). The overall (N_(TXA)/2)-Tx DFF beam         collections are captured in the (N_(TXA)/2)×N matrix B.     -   By using co-phasing in W₂ (described below), the composite         precoder W can synthesize up to N DFT beams.     -   For 4Tx, it should be noted that the Release 8 rank-1 codebook         already contains eight 4Tx DFT beams.     -   The set of W₁ matrices represents (N/Nb)-level partitioning         (hence non-overlapping) of the N beam angles (in X, i.e. each         polarization group).     -   This design results in a codebook size of (N/Nb) for W₁.

If some overlap in the set of beam angles is desired between two different W₁ matrices, the above formulation can be slightly modified such that two consecutive X matrices consists of some overlapping beam angles. Overlapping in beam angles may be beneficial to reduce “edge effects”, i.e. to ensure that a common W₁ matrix can be better chosen for different resource blocks (RBs) within the same precoding sub-band when sub-band precoding or CSI feedback is used. Herein a sub-band refers to a set of continuous physical resource blocks (PRB). With overlapping,

$\begin{matrix} {X^{(k)} \in \begin{Bmatrix} {\left. \begin{matrix} \left\lbrack b_{{({N_{b}{k/2}})}{modN}} \right. & b_{{({{N_{b}{k/2}} + 1})}{modN}} & \ldots & b_{{({{N_{b}{k/2}} + N_{b} - 1})}{modN}} \end{matrix} \right\rbrack \text{:}} \\ {{k = 0},1,\ldots \mspace{14mu},{\frac{2N}{N_{b}} - 1}} \end{Bmatrix}} & (6) \\ {\mspace{79mu} {{W_{1}^{(k)} = \begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}},{C_{1} = \left\{ {W_{1}^{(0)},W_{1}^{(1)},W_{1}^{(2)},\ldots \mspace{14mu},W_{1}^{{({2{N/N_{b}}})} - 1}} \right\}}}} & (7) \end{matrix}$

This enhancement targets MU-MIMO improvement and, therefore, is designed for rank-1 (and at most rank-2). At the same time, the Release 8 4Tx codebook should still be used at least for SU-MIMO. Keeping in mind that dynamic switching (switching without RRC configuration) between SU-MIMO and MU-MIMO is the baseline assumption for Release 12, an eNodeB should be able to use the Release 8 4Tx and the enhanced components interchangeably (i.e. the switching between the two components should be dynamic). Thanks to the dual-stage feedback structure and in particular the W=W₁*W₂ structure, this can be realized in a simple and natural manner. The enhanced component can be augmented or combined with the Release 8 codebook as follows:

-   -   the Release 8 4Tx codebook is used as the codebook for W₂ and         associated with W₁=identity matrix;     -   when PMI₁ indicates that W₁=identity matrix is chosen, CB₂ is         chosen as the original Rel-8 codebook;     -   else, when PMI₁ indicates some other W₁, W₁ and CB₂ are chosen         as the enhanced component.

The above switching/augmentation mechanism features the following:

-   -   best possible 4Tx MU-MIMO codebook enhancement opportunity. This         is because the optimization effort for the new components can be         focused on improving MU-MIMO without the need for considering         the SU-MIMO performance (which is covered by the Release 8 4Tx         codebook). Furthermore, the new components can be designed “from         scratch” as the above augmentation mechanism with Release 8 4Tx         codebook can be done without constraining any of the structures         of the new components.     -   maintain best possible performance for 4Tx SU-MIMO without         additional standardization effort. This comes from the use of         Release 8 4Tx codebook. It is noted that the Release 8 4Tx         codebook offers competitive performance in various antenna and         channel setups including dual-polarized arrays as pointed out         partly due to the inherent block diagonal structure in a number         of the precoder matrices/vectors.     -   achieve flexible frequency-selective precoding with physical         uplink shared channel (PUSCH) mode 3-2. If Release 8 codebook is         not re-used and the new codebook is entirely based on the W=W₁W₂         structure, all subband PMI must fall in the same Grid-of-Beam         (GoB) due to the wideband W₁ constraint. This inevitably limits         the precoding gains of mode 3-2 and system performance. On the         contrary, by augmenting the Release 8 codebook, all Release 8         PMI vectors can be used on each subband independently without         any constraint. This is critical to ensure flexible subband         precoding.

The design for W₂ (based on co-phasing and selection) follows the structure used for 8Tx codebook design. Co-phasing allows some phase adjustment between the two polarization groups and generation of 4Tx DFTTx DFT vectors from two block diagonal 2Tx DFTTx DFT matrices. The (group) selection operation allows refinement/adjustment of beam angles across RBs within the same sub-band thereby maximizing frequency-selective precoding gain.

The combination of beam selection and co-phasing in W₂—combined with W₁-should result in a unitary precoder W=W₁W₂.

An example of a complete design with non-overlapping block diagonal GoB augmentation of (N,Nb) codebook is given in the subsequent sections. It is straightforward to extend the proposed designs to include adjacent W₁ matrix overlapping, but is omitted here due to simplicity.

$\begin{matrix} {{B = \begin{bmatrix} b_{0} & b_{1} & \ldots & b_{N - 1} \end{bmatrix}},{\lbrack B\rbrack_{{1 + m},{1 + n}} = ^{j\frac{2\pi \; {mn}}{N}}},{m = 0},1,{n = 0},1,\ldots \mspace{14mu},{N - 1}} & (8) \\ {X^{(k)} \in \begin{Bmatrix} {\left. \begin{matrix} b_{{({N_{b}k})}{modN}} & b_{{({{N_{b}k} + 1})}{modN}} & \ldots & b_{{({{N_{b}k} + N_{b} - 1})}{modN}} \end{matrix} \right\rfloor \text{:}} \\ {{k = 0},\ldots \mspace{14mu},{{N/N_{b}} - 1}} \end{Bmatrix}} & (9) \end{matrix}$

Rank 1

Assuming (N, Nb)=(8,4) as an example.

$\begin{matrix} {{W_{1} \in C_{1}} = \left\{ {I_{4},\begin{bmatrix} X^{(0)} & 0 \\ 0 & X^{(0)} \end{bmatrix},\begin{bmatrix} X^{(1)} & 0 \\ 0 & X^{(1)} \end{bmatrix}} \right\}} & (10) \end{matrix}$

→size-3 (Rel-8 codebook augmented with block diagonal GoB).

When W₁=I₄, then W₂εC_(2,R8Tx4r1), where C_(2,RBTx4r1) denotes the Release 8 4Tx rank-1 codebook used for W₂.

When

$\; {{W_{1} = \begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}},\left( {{k = 0},1} \right),}$

then

${{W_{2} \in {CB}_{2}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y \\ Y \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y \\ {j\; Y} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y \\ {- Y} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y \\ {{- j}\; Y} \end{bmatrix}}} \right\}},{Y \in \left\{ {\begin{bmatrix} 1 \\ 0 \\ 0 \\ 0 \end{bmatrix},\begin{bmatrix} 0 \\ 1 \\ 0 \\ 0 \end{bmatrix},\begin{bmatrix} 0 \\ 0 \\ 1 \\ 0 \end{bmatrix},\begin{bmatrix} 0 \\ 0 \\ 0 \\ 1 \end{bmatrix}} \right\}}$

The rank-1 PMI overhead for this example is shown in Table 1.

TABLE 1 W1 overhead (wideband) W2 overhead (subband) Rank-1 log2(3)-bits 4-bit

Other values of (N, Nb) are not precluded if justified by sufficient system performance gain and reasonable feedback overhead.

Note that the block-diagonal enhancement components are sub-matrices of a subset of the Release 10 8Tx codebook. As such, the 4Tx GoB components can be obtained by pruning the 8Tx codebook for 4Tx MIMO feedback. This is discussed in more detail below.

N, Nb can also take other values. For example if (N, Nb)=(16, 4).

$\begin{matrix} {{W_{1} \in C_{1}} = \left\{ {I_{4},\begin{bmatrix} X^{(0)} & 0 \\ 0 & X^{(0)} \end{bmatrix},\begin{bmatrix} X^{(1)} & 0 \\ 0 & X^{(1)} \end{bmatrix},\begin{bmatrix} X^{(2)} & 0 \\ 0 & X^{(2)} \end{bmatrix},\begin{bmatrix} X^{(3)} & 0 \\ 0 & X^{(3)} \end{bmatrix}} \right\}} & (11) \end{matrix}$

→size-5 (Rel-8 codebook augmented with block diagonal GoB).

When W₁=I₄, then W₂εC_(2,R8Tx4r1),

where C_(2,R8Tx4r1) denotes the Release 8 4Tx rank-1 codebook used for W₂.

When

$\; {{W_{1} = \begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}},\left( {{k = 0},1,2,3} \right),}$

then

${{W_{2} \in {CB}_{2}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y \\ Y \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y \\ {j\; Y} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y \\ {- Y} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y \\ {{- j}\; Y} \end{bmatrix}}} \right\}},{Y \in \left\{ {\begin{bmatrix} 1 \\ 0 \\ 0 \\ 0 \end{bmatrix},\begin{bmatrix} 0 \\ 1 \\ 0 \\ 0 \end{bmatrix},\begin{bmatrix} 0 \\ 0 \\ 1 \\ 0 \end{bmatrix},\begin{bmatrix} 0 \\ 0 \\ 0 \\ 1 \end{bmatrix}} \right\}}$

The rank-1 PMI overhead for this example is shown in Table 2.

TABLE 2 W1 overhead (wideband) W2 overhead (subband) Rank-1 log2(5)-bits 4-bit

It is possible in some embodiments that the Release 12 4Tx codebook does not comprise the Release 8 codebook. In that case, the identity matrix I₄ is removed from the W₁ codebook C₁.

It is also possible to increase the value of N (e.g. to 32 or 64). This however increases the C₁ codebook size and feedback overhead, and reduces the span of angular spread that Nb adjacent beams can cover.

Rank 2:

Assuming (N,Nb)=(8,4) as an example:

$\begin{matrix} {{{W_{1} \in C_{1}} = \left\{ {I_{4},\begin{bmatrix} X^{(0)} & 0 \\ 0 & X^{(0)} \end{bmatrix},\begin{bmatrix} X^{(1)} & 0 \\ 0 & X^{(1)} \end{bmatrix}} \right\}},} & (12) \end{matrix}$

→size-3 (Rel-8 codebook augmented with block diagonal GoB).

When W₁=I₄, then W₂εC_(2,R8Tx4r2),

where C_(2,R8Tx4r2) denotes the Release 8 4Tx rank-2 codebook used for W₂.

When

$\; {{W_{1} = \begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}},\left( {{k = 0},1} \right),}$

then

${{W_{2} \in {CB}_{2}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y & Y \\ Y & {- Y} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y & Y \\ {j\; Y} & {{- j}\; Y} \end{bmatrix}}} \right\}},{Y \in \left\{ {\begin{bmatrix} 1 \\ 0 \\ 0 \\ 0 \end{bmatrix},\begin{bmatrix} 0 \\ 1 \\ 0 \\ 0 \end{bmatrix},\begin{bmatrix} 0 \\ 0 \\ 1 \\ 0 \end{bmatrix},\begin{bmatrix} 0 \\ 0 \\ 0 \\ 1 \end{bmatrix}} \right\}}$

One minor shortcoming of this design is that the W₂ overhead is not constant, but varying dependent on the W₁ matrix. In particular,

-   -   if W₁=I, W₂ overhead is 4-bits per subband; and     -   If W₁ corresponds to the block-diagonal component, W₂ overhead         is 3-bits per subband.

Because W₁ and W₂ are jointly encoded in the PUSCH feedback mode, joint blind decoding of W₁/W₂ is required at the eNodeB, which may increase the eNodeB implementation complexity.

As one solution, the two columns in a rank-2 precoding matrix W may be chosen from different beams in one grid.

As an example, the following design is possible.

$\begin{matrix} {{W_{1} \in C_{1}} = \left\{ {I_{4},\begin{bmatrix} X^{(0)} & 0 \\ 0 & X^{(0)} \end{bmatrix},\begin{bmatrix} X^{(1)} & 0 \\ 0 & X^{(1)} \end{bmatrix}} \right\}} & (13) \end{matrix}$

→size-3 (Rel-8 codebook augmented with block diagonal GoB).

When W₁=I₄: then W₂εC_(2,R8tx4r2),

where C_(2,R8Tx4r2) denotes the Release 8 4Tx rank-2 codebook used for W₂.

When

${W_{1} = {\begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}\left( {{k = 0},1} \right)}},$

then

$\mspace{20mu} {{{W_{2} \in {CB}_{2}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}}} \right\}},{\left( {Y_{1},Y_{2}} \right) \in \left\{ {\left( {e_{1}^{4},e_{1}^{4}} \right),\left( {e_{2}^{4},e_{2}^{4}} \right),\left( {e_{3}^{4},e_{3}^{4}} \right),\left( {e_{4}^{4},e_{4}^{4}} \right),\left( {e_{1}^{4},e_{2}^{4}} \right),\left( {e_{2}^{4},e_{3}^{4}} \right),\left( {e_{1}^{4},e_{4}^{4}} \right),\left( {e_{2}^{4},e_{4}^{4}} \right)} \right\}}}$

where e_(q) ^(p) is a p×1 column vector with all elements equivalent to zero, except the q-th element which is 1. The W₂ overhead is 4-bits per subband, consistent with the Release 8 codebook overhead. Note that any other (Y₁,Y₂) pair, denoted by (e_(m) ⁴,e_(n) ⁴), are equally applicable, where 1≦m≦4, 1≦n≦4, m≠n.

Note that in any of the (Y₁, Y₂) pair above, the two selection vectors inside the brackets [ ] can be permuted. For example, (e₁ ⁴,e₂ ⁴) can be replaced by (e₂ ⁴,e₁ ⁴), and the resulting codebook is equivalently applicable.

It should be noted that that the block-diagonal enhancement components are sub-matrices of a subset of the Release 10 8Tx codebook.

As another solution, it can be resolved by adopting a (N, Nb)=(16, 8) codebook enhancement.

$\begin{matrix} {{W_{1} \in C_{1}} = \left\{ {I_{4},\begin{bmatrix} X^{(0)} & 0 \\ 0 & X^{(0)} \end{bmatrix},\begin{bmatrix} X^{(1)} & 0 \\ 0 & X^{(1)} \end{bmatrix}} \right\}} & (14) \end{matrix}$

→size-3 (Rel-8 codebook augmented with block diagonal GoB).

When W₁=I₄, then W₂εC_(2,R8Tx4r2),

where C_(2,R8Tx4r2) denotes the Release 8 4Tx rank-2 codebook used for W₂.

When

${W_{1} = {\begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}\left( {{k = 0},1} \right)}},$

then

${{W_{2} \in {CB}_{2}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y & Y \\ Y & {- Y} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y & Y \\ {j\; Y} & {{- j}\; Y} \end{bmatrix}}} \right\}},{Y \in \left\{ {\begin{bmatrix} 1 \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \end{bmatrix},\begin{bmatrix} 0 \\ 1 \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \end{bmatrix},\begin{bmatrix} 0 \\ 0 \\ 1 \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \end{bmatrix},\begin{bmatrix} 0 \\ 0 \\ 0 \\ 1 \\ 0 \\ 0 \\ 0 \\ 0 \end{bmatrix},\begin{bmatrix} 0 \\ 0 \\ 0 \\ 0 \\ 1 \\ 0 \\ 0 \\ 0 \end{bmatrix},\begin{bmatrix} 0 \\ 0 \\ 0 \\ 0 \\ 0 \\ 1 \\ 0 \\ 0 \end{bmatrix},\begin{bmatrix} 0 \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \\ 1 \\ 0 \end{bmatrix},\begin{bmatrix} 0 \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \\ 0 \\ 1 \end{bmatrix},} \right\}}$

The rank-2 PMI overhead for this example is shown in Table 3.

TABLE 3 W1 overhead (wideband) W2 overhead (subband) Rank-2 log2(3)-bit 4-bit

Alternatively, it is possible that the Release 12 4Tx codebook does not comprise of the Release 8 codebook. In that case, the identity matrix is removed from the W₁ codebook C₁.

Another possible design is to use (N,Nb)=(16,4) as

$\begin{matrix} {{W_{1} \in C_{1}} = \left\{ {I_{4},\begin{bmatrix} X^{(0)} & 0 \\ 0 & X^{(0)} \end{bmatrix},\begin{bmatrix} X^{(1)} & 0 \\ 0 & X^{(1)} \end{bmatrix},\begin{bmatrix} X^{(2)} & 0 \\ 0 & X^{(2)} \end{bmatrix},\begin{bmatrix} X^{(3)} & 0 \\ 0 & X^{(3)} \end{bmatrix}} \right\}} & (15) \end{matrix}$

→size-5 (Rel-8 codebook augmented with block diagonal GoB).

When W₁=I₄, then W₂εC_(2,R8Tx4r2),

where C_(2,R8Tx4r2) denotes the Release 8 4Tx rank-2 codebook used for W₂.

When

${W_{1} = {\begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}\left( {{k = 0},\ldots \mspace{14mu},3} \right)}},$

then

$\mspace{20mu} {{{W_{2} \in {CB}_{2}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}}} \right\}},{\left( {Y_{1},Y_{2}} \right) \in \left\{ {\left( {e_{1}^{4},e_{1}^{4}} \right),\left( {e_{2}^{4},e_{2}^{4}} \right),\left( {e_{3}^{4},e_{3}^{4}} \right),\left( {e_{4}^{4},e_{4}^{4}} \right),\left( {e_{1}^{4},e_{2}^{4}} \right),\left( {e_{2}^{4},e_{3}^{4}} \right),\left( {e_{1}^{4},e_{4}^{4}} \right),\left( {e_{2}^{4},e_{4}^{4}} \right)} \right\}}}$

It is also possible to increase the value of N (e.g. to 32 or 64). This however increases the C₁ codebook size and feedback overhead, and reduces the span of angular spread that Nb adjacent beams can cover.

Rank 3:

The simplest solution is to reuse the Release 8 codebook as-is for Release 12.

W ₁ =I ₄  (16)

→size-1 (Re-8 codebook only).

W ₂ εC _(2,R8Tx4r3),

where C_(2,R8Tx4r3) denotes the Release 8 4Tx rank-3 codebook used for W₂.

If enhancement based on (N,Nb) structure is warranted by sufficient performance gain, it can be done in a similar fashion as for rank-1 and rank-2. For instance, based on a (N,Nb)=(4,4) design:

$\begin{matrix} {{W_{1} \in C_{1}} = \left\{ {I_{4},\begin{bmatrix} X^{(0)} & 0 \\ 0 & X^{(0)} \end{bmatrix}} \right\}} & (17) \end{matrix}$

→size-2 (Rel-8 codebook augmented with block diagonal GoB).

When W₁=I₄, then W₂εC_(2,R8Tx4r3),

where C_(2,R8Tx4r3) denotes the Release 8 4Tx rank-3 codebook used for W₂.

When

${W_{1} = {\begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}\left( {k = 0} \right)}},$

then

$\mspace{20mu} {{W_{2} \in {CB}_{2}} = \left\{ {\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}} \right\}}$ ${\left( {Y_{1},Y_{2}} \right) \in \begin{Bmatrix} {\left( {e_{1}^{4},\left\lbrack {e_{1}^{4},e_{3}^{4}} \right\rbrack} \right),\left( {e_{2}^{4},\left\lbrack {e_{2}^{4},e_{4}^{4}} \right\rbrack} \right),\left( {e_{3}^{4},\left\lbrack {e_{1}^{4},e_{3}^{4}} \right\rbrack} \right),\left( {e_{4}^{4},\left\lbrack {e_{2}^{4},e_{4}^{4}} \right\rbrack} \right),} \\ {\left( {\left\lbrack {e_{1}^{4},e_{3}^{4}} \right\rbrack,e_{1}^{4}} \right),\left( {\left\lbrack {e_{2}^{4},e_{4}^{4}} \right\rbrack,e_{2}^{4}} \right),\left( {\left\lbrack {e_{1}^{4},e_{3}^{4}} \right\rbrack,e_{3}^{4}} \right),\left( {\left\lbrack {e_{2}^{4},e_{4}^{4}} \right\rbrack,e_{4}^{4}} \right),} \end{Bmatrix}},$

corresponding to i₂=0, . . . , 7.

To make the W₂ overhead consistent for different W₁ matrices, i₂=8, . . . , 15 shall be reserved for W₂ corresponding to W₁ matrices that are enhancement components (e.g. block diagonal).

Alternatively, when

${W_{1} = {\begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}\left( {k = 0} \right)}},$

then

$\mspace{20mu} {{{W_{2} \in {CB}_{2}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}}} \right\}},{\left( {Y_{1},Y_{2}} \right) \in {\begin{Bmatrix} {\left( {e_{1}^{4},\left\lbrack {e_{1}^{4},e_{3}^{4}} \right\rbrack} \right),\left( {e_{2}^{4},\left\lbrack {e_{2}^{4},e_{4}^{4}} \right\rbrack} \right),\left( {e_{3}^{4},\left\lbrack {e_{1}^{4},e_{3}^{4}} \right\rbrack} \right),\left( {e_{4}^{4},\left\lbrack {e_{2}^{4},e_{4}^{4}} \right\rbrack} \right),} \\ {\left( {\left\lbrack {e_{1}^{4},e_{3}^{4}} \right\rbrack,e_{1}^{4}} \right),\left( {\left\lbrack {e_{2}^{4},e_{4}^{4}} \right\rbrack,e_{2}^{4}} \right),\left( {\left\lbrack {e_{1}^{4},e_{3}^{4}} \right\rbrack,e_{3}^{4}} \right),\left( {\left\lbrack {e_{2}^{4},e_{4}^{4}} \right\rbrack,e_{4}^{4}} \right)} \end{Bmatrix}.}}}$

In this case W2 overhead is 4-bits per sub-band

The rank-3 PMI overhead for this example is shown in Table 4.

TABLE 4 W1 overhead (wideband) W2 overhead (subband) Rank-3 0-bit (w/o augmentation) 4-bit 1-bit (w/augmentation)

It is possible that the Release 12 4Tx codebook does not comprise of the Release 8 codebook. In that case, the identity matrix is removed from the Wt codebook C₃.

Note that in any of the (Y₁, Y₂) pairs above, the two selection vectors inside the brackets can be permuted. For example, (e₁ ⁴,[e₁ ⁴,e₃ ⁴]) can be replaced by (e₁ ⁴,[e₃ ⁴,e₁ ⁴]), and the resulting codebook is equivalently applicable.

It is not precluded that the Release 12 4Tx rank-3 codebook is redesigned using the GoB component as proposed above, and not include any Release 8 4Tx rank-3 precoding matrices.

Another alternative GoB design is (N,Nb)=(8,8), where

$\mspace{20mu} {{W_{1} = {\begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}\left( {k = 0} \right)}},{and}}$ $\mspace{20mu} {{{W_{2} \in {CB}_{2}} = \left\{ {\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}} \right\}},{or}}$ $\mspace{20mu} {{W_{2} \in {CB}_{2}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}}} \right\}}$ $\left( {Y_{1},Y_{2}} \right) \in \begin{Bmatrix} \begin{matrix} \begin{matrix} {\left( {e_{1}^{4},\left\lbrack {e_{1}^{4},e_{5}^{4}} \right\rbrack} \right),\left( {e_{2}^{4},\left\lbrack {e_{2}^{4},e_{6}^{4}} \right\rbrack} \right),\left( {e_{3}^{4},\left\lbrack {e_{3}^{4},e_{7}^{4}} \right\rbrack} \right),\left( {e_{4}^{4},\left\lbrack {e_{4}^{4},e_{8}^{4}} \right\rbrack} \right),} \\ {\left( {e_{5}^{4},\left\lbrack {e_{1}^{4},e_{5}^{4}} \right\rbrack} \right),\left( {e_{6}^{4},\left\lbrack {e_{2}^{4},e_{6}^{4}} \right\rbrack} \right),\left( {e_{7}^{4},\left\lbrack {e_{3}^{4},e_{7}^{4}} \right\rbrack} \right),\left( {e_{3}^{4},\left\lbrack {e_{4}^{4},e_{8}^{4}} \right\rbrack} \right),} \end{matrix} \\ {\left( {\left\lbrack {e_{1}^{4},e_{5}^{4}} \right\rbrack,e_{1}^{4}} \right),\left( {\left\lbrack {e_{2}^{4},e_{6}^{4}} \right\rbrack,e_{2}^{4}} \right),\left( {\left\lbrack {e_{3}^{4},e_{7}^{4}} \right\rbrack,e_{3}^{4}} \right),\left( {\left\lbrack {e_{4}^{4},e_{8}^{4}} \right\rbrack,e_{4}^{4}} \right),} \end{matrix} \\ {\left( {\left\lbrack {e_{1}^{4},e_{5}^{4}} \right\rbrack,e_{5}^{4}} \right),\left( {\left\lbrack {e_{2}^{4},e_{6}^{4}} \right\rbrack,e_{6}^{4}} \right),\left( {\left\lbrack {e_{3}^{4},e_{7}^{4}} \right\rbrack,e_{7}^{4}} \right),\left( {\left\lbrack {e_{4}^{4},e_{8}^{4}} \right\rbrack,e_{8}^{4}} \right),} \end{Bmatrix}$

Rank 4:

The simplest solution is to reuse Release 8 codebook as-is for Release 12.

W ₁ =I ₄  (18)

→Size-1 (Rel-8 codebook only).

W ₂ εC _(2,R8Tx4r4),

where C_(2,R8Tx4r4) denotes the Release 8 4Tx rank-4 codebook used for W₂.

If enhancement based on (N,Nb) structure is warranted by sufficient performance gain, it can be done in a similar fashion as for rank-1 and rank-2. For instance, based on a (N,Nb)=(4,4) design,

$\begin{matrix} {{W_{1} \in C_{1}} = \left\{ {I_{4},\begin{bmatrix} X^{(0)} & 0 \\ 0 & X^{(0)} \end{bmatrix}} \right\}} & (19) \end{matrix}$

→Size-2 (Rel-8 codebook augmented with block diagonal GoB)

When W₁=I₄, then W₂εC_(2,R8Tx4r4),

where C_(2,R8Tx4r4) denotes the Release 8 4Tx rank-4 codebook used for W₂.

When

${W_{1} = {\begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}\left( {k = 0} \right)}},$

then

${{W_{2} \in {CB}_{2}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {jY}_{1} & {- {jY}_{2}} \end{bmatrix}}} \right\}},{{{where}\left( {Y_{1},Y_{2}} \right)} \in \begin{Bmatrix} {\left( {\left\lbrack {e_{1}^{4},e_{3}^{4}} \right\rbrack,\left\lbrack {e_{1}^{4},e_{3}^{4}} \right\rbrack} \right),\left( {\left\lbrack {e_{2}^{4},e_{4}^{4}} \right\rbrack,\left\lbrack {e_{2}^{4},e_{4}^{4}} \right\rbrack} \right),} \\ {\left( {\left\lbrack {e_{1}^{4},e_{3}^{4}} \right\rbrack,\left\lbrack {e_{2}^{4},e_{4}^{4}} \right\rbrack} \right),\left( {\left\lbrack {e_{2}^{4},e_{4}^{4}} \right\rbrack,\left\lbrack {e_{1}^{4},e_{3}^{4}} \right\rbrack} \right),} \end{Bmatrix}},$

corresponding to i₁=0, . . . , 7.

Note there are a total of 8 W₂ matrices (i₂=0, . . . , 7) for

$W_{1} = {\begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}.}$

To make the W₂ overhead consistent across all W₁, W₂ can be reserved for i₂=8, . . . , 15.

Alternatively, one may adopt a (N, Nb)=(8,8) codebook as below:

$\begin{matrix} {{W_{1} \in C_{1}} = \left\{ {I_{4},\begin{bmatrix} X^{(0)} & 0 \\ 0 & X^{(0)} \end{bmatrix}} \right\}} & (20) \end{matrix}$

→Size-2 (Rel-8 codebook augmented with block diagonal GoB).

When W₁=I₄, then W₂εC_(2,R8Tx4r4),

where C_(2,R8Tx4r4) denotes the Release 8 4Tx rank-4 codebook used for W₂.

When

${W_{1} = {\begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}\left( {k = 0} \right)}},$

then

${{W_{2} \in {CB}_{2}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {jY}_{1} & {- {jY}_{2}} \end{bmatrix}}} \right\}},{{{and}\left( {Y_{1},Y_{2}} \right)} \in {\begin{Bmatrix} {\left( {\left\lbrack {e_{1}^{8},e_{5}^{8}} \right\rbrack,\left\lbrack {e_{1}^{8},e_{5}^{8}} \right\rbrack} \right),\left( {\left\lbrack {e_{2}^{8},e_{6}^{8}} \right\rbrack,\left\lbrack {e_{2}^{8},e_{6}^{8}} \right\rbrack} \right),\left( {\left\lbrack {e_{3}^{8},e_{7}^{8}} \right\rbrack,\left\lbrack {e_{3}^{8},e_{7}^{8}} \right\rbrack} \right),\left( {\left\lbrack {e_{4}^{8},e_{8}^{8}} \right\rbrack,\left\lbrack {e_{4}^{8},e_{8}^{8}} \right\rbrack} \right),} \\ {\left( {\left\lbrack {e_{1}^{8},e_{5}^{8}} \right\rbrack,\left\lbrack {e_{2}^{8},e_{6}^{8}} \right\rbrack} \right),\left( {\left\lbrack {e_{1}^{8},e_{5}^{8}} \right\rbrack,\left\lbrack {e_{3}^{8},e_{7}^{8}} \right\rbrack} \right),\left( {\left\lbrack {e_{2}^{8},e_{6}^{8}} \right\rbrack,\left\lbrack {e_{4}^{8},e_{8}^{8}} \right\rbrack} \right),\left( {\left\lbrack {e_{3}^{8},e_{7}^{8}} \right\rbrack,\left\lbrack {e_{4}^{8},e_{8}^{8}} \right\rbrack} \right)} \end{Bmatrix}.}}$

Note that in any of the (Y₁, Y₂) pair above, the two selection vectors inside the brackets [ ] can be permuted.

Also note that any (Y₁,Y₂) pair above can be replaced by a different pair denoted as ([e_(m) ^(N) ^(b) , e_(m+N/2) ^(N) ^(b) ],[e_(n) ^(N) ^(b) ,e_(n+N/2) ^(N) ^(b) ]), where 1≦m≦N/2, 1≦n≦N/2.

The rank-4 PMI overhead for this example is shown in Table 5.

TABLE 5 W1 overhead (wideband) W2 overhead (sub-band) Rank-4 0-bit (w/o augmentation) 4-bit 1-bit (w/augmentation)

It is possible that the Release 12 4Tx codebook does not comprise of the Release 8 codebook. In that case, the identity matrix is removed from the W₁ codebook C₁.

It is not precluded that the Release 12 4Tx rank-4 codebook is redesigned using the GoB component as proposed above, and not includes any Release 8 4Tx rank-4 precoding matrices.

The final 4Tx codebook comprises of rank-r codebook, r=1, 2, 3, 4. For each rank r, the corresponding rank-r codebook can be constructed by methods discussed above regarding rank-1 to rank-4 codebooks. It is not precluded that codebook is enhanced for certain rank(s), while for the other ranks, Release 8 codebook is reused.

Reformulation of Proposed Rank-1 to Rank-4 Codebooks

Using (N, Nb)=(16,4) as an example, the proposed codebook in the sections above may be re-formulated by the equations shown in the tables below. It should be noted that these tables can be easily extended to other (N, Nb) values.

Rank 1-2

If Release 12 4Tx codebook for rank-1 and rank-2 is redesigned by the GoB framework with adjacent beams overlapping, and does not include the Release 8 codebook, the 4Tx codebooks can be expressed by equations in Tables 6-1 and 6-2.

A first PMI value of n₁ε{0, 1, . . . , ƒ(ν)−1} and a second PMI value of n₂ε{0, 1, . . . , g(ν)−1} correspond to the codebook indices n₁ and n₂ given in Table.6-j, where ν is equal to the associated rank value and where j=ν, ƒ(ν)={8,8} and g(ν)={16,16}. Interchangeably, the first and second precoding matrix indicators are expressed by i₁ and i₂.

The quantities φ_(n) and v_(m) are expressed by

φ_(n) =e ^(jnm/2)  (21)

v _(m)=[1;e ^(j2nm/16)]  (22)

Table 6-1 illustrates a codebook for 1-layer CSI reporting according to one embodiment

TABLE 6-1 i₂ i₁ 0 1 2 3 4 5 6 7 0-7 W⁽¹⁾ _(2i) ₁ _(,0) W⁽¹⁾ _(2i) ₁ _(,1) W⁽¹⁾ _(2i) ₁ _(,2) W⁽¹⁾ _(2i) ₁ _(,3) W⁽¹⁾ _(2i) ₁ _(+1,0) W⁽¹⁾ _(2i) ₁ _(+1,1) W⁽¹⁾ _(2i) ₁ _(+1,2) W⁽¹⁾ _(2i) ₁ _(+1,3) i₂ i₁ 8 9 10 11 12 13 14 15 0-7 W⁽¹⁾ _(2i) ₁ _(+2,0) W⁽¹⁾ _(2i) ₁ _(+2,1) W⁽¹⁾ _(2i) ₁ _(+2,2) W⁽¹⁾ _(2i) ₁ _(+2,3) W⁽¹⁾ _(2i) ₁ _(+3,0) W⁽¹⁾ _(2i) ₁ _(+3,1) W⁽¹⁾ _(2i) ₁ _(+3,2) W⁽¹⁾ _(2i) ₁ _(+3,3) where  $W_{m,n}^{(1)} = {\frac{1}{\sqrt{4}}\begin{bmatrix} v_{m} \\ {\phi_{n}v_{m}} \end{bmatrix}}$

Table 6-2 illustrates a codebook for 2-layer CSI reporting according to one embodiment.

TABLE 6-2 i₂ i₁ 0 1 2 3 0-7 W⁽²⁾ _(2i) ₁ _(,2i) ₁ _(,0) W⁽²⁾ _(2i) ₁ _(,2i) ₁ _(,1) W⁽²⁾ _(2i) ₁ _(+1,2i) ₁ _(+1,0) W⁽²⁾ _(2i) ₁ _(+1,2i) ₁ _(+1,1) i₂ i₁ 4 5 6 7 0-7 W⁽²⁾ _(2i) ₁ _(+2,2i) ₁ _(+2,0) W⁽²⁾ _(2i) ₁ _(+2,2i) ₁ _(+2,1) W⁽²⁾ _(2i) ₁ _(+3,2i) ₁ _(+3,0) W⁽²⁾ _(2i) ₁ _(+3,2i) ₁ _(+3,1) i₂ i₁ 8 9 10 11 0-7 W⁽²⁾ _(2i) ₁ _(,2i) ₁ _(+1,0) W⁽²⁾ _(2i) ₁ _(,2i) ₁ _(+1,1) W⁽²⁾ _(2i) ₁ _(+1,2i) ₁ _(+2,0) W⁽²⁾ _(2i) ₁ _(+1,2i) ₁ _(+2,1) i₂ i₁ 12 13 14 15 0-7 W⁽²⁾ _(2i) ₁ _(,2i) ₁ _(+3,0) W⁽²⁾ _(2i) ₁ _(,2i) ₁ _(+3,1) W⁽²⁾ _(2i) ₁ _(+1,2i) ₁ _(+3,0) W⁽²⁾ _(2i) ₁ _(+1,2i) ₁ _(+3,1) where  $W_{m,m^{\prime},n}^{(2)} = {\frac{1}{\sqrt{8}}\begin{bmatrix} v_{m} & v_{m^{\prime}} \\ {\phi_{n}v_{m}} & {{- \phi_{n}}v_{m^{\prime}}} \end{bmatrix}}$

If the Release 12 4Tx codebook for rank-1 and rank-2 is designed by augmenting the existing Release 8 codebook with GoB components, then the Release 12 4Tx codebook can be expressed as in Table 6-3 and Table 6-4.

Table 6-3 illustrates a codebook for 1-layer CSI reporting according to one embodiment.

TABLE 6-3 i₁ i₂ 0 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Use precoding matrix of index i₂ of Release 8 4Tx rank-1 codebook i₁ i₂ 1-8 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Corresponding to i₁ = 0-7 in table 6-1

Table 6-4 illustrates a codebook for 2-layer CSI reporting according to one embodiment.

TABLE 6-4 i₁ i₂ 0 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Use precoding matrix of index i₂ of Release 8 4Tx rank-1 codebook i₁ i₂ 1-8 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Corresponding to i₁ = 0-7 in table 6-2

Rank 3-4

If the Release 12 4Tx codebook for rank-3 and rank-3 is redesigned by the GoB framework with adjacent beams overlapping, and not includes the Release 8 codebook, the 4Tx codebooks can be expressed by equations in Table 6-5 and 6-6.

Table 6-5 illustrates a codebook for 3-layer CSI reporting according to one embodiment.

TABLE 6-5 i₂ i₁ 0 1 2 3 0 W⁽³⁾ _(16i) ₁ _(,16i) ₁ _(,16i) ₁ _(+8,0) W⁽³⁾ _(16i) ₁ _(,16i) ₁ _(,16i) ₁ _(+8,1) W⁽³⁾ _(16i) ₁ _(+4,16i) ₁ _(+4,16i) ₁ _(+12,0) W⁽³⁾ _(16i) ₁ _(+4,16i) ₁ _(+4,16i) ₁ _(+12,1) i₂ i₁ 4 5 6 7 0 W⁽³⁾ _(16i) ₁ _(+8,16i) ₁ _(,16i) ₁ _(+8,0) W⁽³⁾ _(16i) ₁ _(+8,16i) ₁ _(,16i) ₁ _(+8,1) W⁽³⁾ _(16i+12) _(i) _(,16i) ₁ _(+4,16i) ₁ _(+12,0) W⁽³⁾ _(16i) ₁ _(+12,16i) ₁ _(+4,16i) ₁ _(+12,1) i₂ i₁ 8 9 10 11 0 {tilde over (W)}⁽³⁾ _(16i) ₁ _(,16i) ₁ _(+8,16i) ₁ _(,0) {tilde over (W)}⁽³⁾ _(16i) ₁ _(,16i) ₁ _(+8,16i) ₁ _(,1) {tilde over (W)}⁽³⁾ _(16i) ₁ _(+4,16i) ₁ _(+12,16i) ₁ _(+4,0) {tilde over (W)}⁽³⁾ _(16i) ₁ _(+4,16i) ₁ _(+12,16i) ₁ _(+4,1) i₂ i₁ 12 13 14 15 0 {tilde over (W)}⁽³⁾ _(16i) ₁ _(,16i) ₁ _(+8,16i) ₁ _(+8,0) {tilde over (W)}⁽³⁾ _(16i) ₁ _(,16i) ₁ _(+8,16i) ₁ _(+8,1) {tilde over (W)}⁽³⁾ _(16i) ₁ _(+4,16i) ₁ _(+12,16i) ₁ _(+12,0) {tilde over (W)}⁽³⁾ _(16i) ₁ _(+4,16i) ₁ _(+12,16i) ₁ _(+12,1) where  ${W_{m,m^{\prime},m^{''},n}^{(3)} = {\frac{1}{\sqrt{12}}\begin{bmatrix} v_{m} & v_{m^{\prime}} & v_{m^{''}} \\ {\phi_{n}v_{m}} & {{- \phi_{n}}v_{m^{\prime}}} & {{- \phi_{n}}v_{m^{''}}} \end{bmatrix}}},$ ${\overset{\sim}{W}}_{m,m^{\prime},m^{''},n}^{(3)} = {\frac{1}{\sqrt{12}}\begin{bmatrix} v_{m} & v_{m^{\prime}} & v_{m^{''}} \\ {\phi_{n}v_{m}} & {\phi_{n}v_{m^{\prime}}} & {{- \phi_{n}}v_{m^{''}}} \end{bmatrix}}$

Table 6-6 illustrates a codebook for 4-layer CSI reporting according to one embodiment.

TABLE 6-6 i₂ i₁ 0 1 2 3 0 W⁽⁴⁾ _(16i) ₁ _(,16i) ₁ _(+8,16i) ₁ _(,16i) ₁ _(+8,0) W⁽⁴⁾ _(16i) ₁ _(,16i) ₁ _(+8,16i) ₁ _(,16i) ₁ _(+8,1) W⁽⁴⁾ _(16i) ₁ _(+4,16i) ₁ _(+12,16i) ₁ _(+4,16i) ₁ _(+12,0) W⁽⁴⁾ _(16i) ₁ _(+4,16i) ₁ _(+12,16i) ₁ _(+4,16i) ₁ _(+12,1) i₂ i₁ 4 5 6 7 0 W⁽⁴⁾ _(16i) ₁ _(,16i) ₁ _(+8,16i) ₁ _(+4,16i) ₁ _(+12,0) W⁽⁴⁾ _(16i) ₁ _(,16i) ₁ _(+8,16i) ₁ _(+4,16i) ₁ _(+12,1) W⁽⁴⁾ _(16i) ₁ _(+4,16i) ₁ _(+12,16i) ₁ _(,16i) ₁ _(+8,0) W⁽⁴⁾ _(16i) ₁ _(+4,16i) ₁ _(+12,16i) ₁ _(,16i) ₁ _(+8,1) where  $W_{m,m^{\prime},m^{''},m^{''\prime},n}^{(4)} = {\frac{1}{\sqrt{16}}\begin{bmatrix} v_{m} & v_{m^{\prime}} & v_{m^{''}} & v_{m^{''\prime}} \\ {\phi_{n}v_{m}} & {\phi_{n}v_{m^{\prime}}} & {{- \phi_{n}}v_{m^{''}}} & {{- \phi_{n}}v_{m^{''\prime}}} \end{bmatrix}}$

If the Release 12 4Tx codebook for rank-3 and rank-3 is designed by augmenting the existing Release 8 codebook with GoB components, the Release 12 4Tx codebook can be expressed as in Table 6-7 and Table 6-8.

Table 6-7 illustrates a codebook for 3-layer CSI reporting according to one embodiment.

TABLE 6-7 i₁ i₂ 0 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Use precoding matrix of index i₂ of Release 8 4Tx rank-3 codebook i₁ i₂ 1-8 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Corresponding to i₁ = 0-7 in Table 6-5.

Table 6-8 illustrates a codebook for 4-layer CSI reporting according to one embodiment.

TABLE 6-8 i₁ i₂ 0 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Use precoding matrix of index i₂ of Release 8 4Tx rank-4 codebook i₁ i₂ 1-8 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 For i₂ = 0-7: corresponding to i₁ = 0-7 in Table 6-6. For i₂ = 8-15: reserved.

Alternative Codebook Designs

For the W₁ codebook C₁ proposed above, the GoB component is expressed in the form of a block diagonal matrix as

$\begin{matrix} {{W_{1} \in C_{1}} = \left\{ {I_{4},\begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}} \right\}} & (23) \end{matrix}$

where without overlapping:

$\begin{matrix} {{X^{(k)} \in \left\{ {{{\begin{bmatrix} b_{{({N_{b}k})}{mod}\; N} & b_{{({{N_{b}k} + 1})}{mod}\; N} & \ldots & b_{{({{N_{b}k} + N_{b} - 1})}{mod}\; N} \end{bmatrix}\text{:}\mspace{14mu} k} = 0},1,\ldots \mspace{14mu},{\frac{N}{N_{b}} - 1}} \right\}},} & (24) \end{matrix}$

and with overlapping:

$\begin{matrix} {{X^{(k)} \in \left\{ {{{\begin{bmatrix} b_{{({N_{b}{k/2}})}{mod}\; N} & b_{{({{N_{b}{k/2}} + 1})}{mod}\; N} & \ldots & b_{{({{N_{b}{k/2}} + N_{b} - 1})}{mod}\; N} \end{bmatrix}\text{:}\mspace{14mu} k} = 0},1,\ldots \mspace{14mu},{\frac{2N}{N_{b}} - 1}} \right\}},} & (25) \end{matrix}$

Each X^((k)) represents a group of Nb adjacent beams that model a certain angle of arrival and angular spread.

Alternative designs are possible where the block diagonal sub-matrix of W₁ (i.e. X^((k))) is replaced by linear or non-linear transformations of X^((k)), for example:

$\begin{matrix} {{{{W_{1}\left( {n,m,k} \right)} \in C_{1}} = \left\{ {\begin{bmatrix} {f_{n}\left( X^{(k)} \right)} & 0 \\ 0 & {g_{m}\left( X^{(k)} \right)} \end{bmatrix},{k = 0},\ldots} \right\}},} & (26) \end{matrix}$

where ƒ_(n)( ), g_(m)( ), n=0, . . . , m=0, . . . are linear/non-linear transformation functions.

In the following section several such possible designs are described assuming (N,Nb)=(16,4) as an example, but extension to other (N, Nb) values are straightforward.

It is also assumed that the Release 12 4Tx codebook is redesigned using the GoB structure and does not include the Release 8 4Tx codebook; however it is straightforward to augment the Release 8 4Tx codebook by the designs proposed below.

Example 1 Beam Shifting

In one embodiment,

$\begin{matrix} {{{W_{1}\left( {n,m,k} \right)} \in C_{1}} = {\left\{ {\begin{bmatrix} {f_{n}\left( X^{(k)} \right)} & 0 \\ 0 & {g_{m}\left( X^{(k)} \right)} \end{bmatrix},{k = 0},\ldots} \right\} = {\begin{bmatrix} X^{(k)} & 0 \\ 0 & {{D(m)}X^{(k)}} \end{bmatrix}.}}} & (27) \end{matrix}$

Alternatively,

$\begin{matrix} {C_{1} = {\begin{bmatrix} {{D(m)}X^{(k)}} & 0 \\ 0 & X^{(k)} \end{bmatrix}.}} & (28) \end{matrix}$

D(m) (m=0, 1 . . . N−1) is a Nt/2×Nt/2 diagonal matrix, in the case of Nt=4 denoted as

$\begin{matrix} {D = {\begin{bmatrix} 1 & 0 \\ 0 & ^{j\frac{2{mn}}{N}} \end{bmatrix}.}} & (29) \end{matrix}$

Herein D(m) performs beam shifting. For instance, as the first sub-matrix X^((k)) comprises of Nb adjacent beams b_((N) _(b) _(k)mod N) b_((N) _(b) _(k+1)mod N) . . . b_((N) _(b) _(k+N) _(b) _(−1)mod N), the second sub-matrix D(m)X^((k)) comprises a different grid of Nb beams as b_((N) _(b) _(k+m)mod N) b_((N) _(b) _(k+1+m)mod N) . . . b_((N) _(b) _(k+N) _(b) _(−1+m)mod N).

In other words, the second grid of beam is shifted by m beams, where m can take values from 0 to N−1. If m=0, . . . N−1, the W codebook size is increased to

$N\frac{N}{N_{b}}$

without W₁ overlapping, and

$N\frac{2N}{N_{b}}$

with W₁ overlapping. Note that the codebook proposed in the initial sections above is a special case where m=0, in which case there is no beam shifting.

FIG. 4 illustrates an example in which a grid of beams is shifted by m=2 beams. A first grid of Nb beams 401 is selected from N beams 402. The second grid of beams 403 is selected from the N beams 402, but is shifted by two beams 404, 405 relative to the first grid of beams 401.

It is not precluded that a subset of D(m) matrices are used in constructing codebook C₁, where mεΠ, Π⊂{0, . . . N−1}. For instance, when Π={1}, the Nb beams in the second grid of beams (e.g., for the vertical polarization array 402) are all shifted by 1 beam, which is half of the number of overlapping beams (Nb/2=2) between two consecutive W₁ matrices. As another example, when Π={0,1}, the second grid of Nb beams may be unshifted, or shifted by one beam.

In another embodiment, both the first and second grid of beams may be shifted. This is expressed as:

$\begin{matrix} {{{{{W_{1}\left( {n,m,k} \right)} \in C_{1}} = {\left\{ {\begin{bmatrix} {f_{n}\left( X^{(k)} \right)} & 0 \\ 0 & {g_{m}\left( X^{(k)} \right)} \end{bmatrix},{K = 0},\ldots} \right\} = \begin{bmatrix} {{G(n)}X^{(k)}} & 0 \\ 0 & {{D(m)}X^{(k)}} \end{bmatrix}}},\mspace{20mu} {where}}\mspace{20mu} {{{G(n)} = \begin{bmatrix} 1 & 0 \\ 0 & ^{j\frac{2\pi \; n}{N}} \end{bmatrix}},\left( {{n = 0},{{1\mspace{14mu} \ldots \mspace{14mu} N} - 1}} \right),\mspace{20mu} {{D(m)} = \begin{bmatrix} 1 & 0 \\ 0 & ^{j\frac{2\pi \; n}{N}} \end{bmatrix}},{\left( {{m = 0},{{{1\mspace{14mu}...}\mspace{14mu} N} - 1}} \right).}}} & (30) \end{matrix}$

Similarly, it is possible to use a subset of G(n) and D(m) matrices in generating the codebook C₁.

Example 2 Beam Permutation

It is further possible to permute the selected beams in one or both sub-matrices of W₁. As one example, the W₁ codebook is expressed as:

$\begin{matrix} {{{W_{1}\left( {l,m,k} \right)} \in {C_{1}\left\{ \begin{bmatrix} X^{(k)} & 0 \\ 0 & {{D(m)}X^{(k)}{P(l)}} \end{bmatrix} \right\}}},} & (31) \end{matrix}$

where P(l) is a 4×4 column permutation of an N_(b)×N_(b) identity matrix I_(N) _(b) .

One example of P(l) is

${p(l)} = {\begin{bmatrix} 0 & 1 & 0 & 0 \\ 1 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{bmatrix}.}$

By multiplying P(l) to D(m)X^((k)), the Nb beams in the second sub-matrix D(m)X^((k)) are permuted before being co-phased with the first grid of beam X^((k)), providing further diversity gain in the W₁ codebook.

Permutation can be performed for both sub-matrices of W₁. In another example, the W₁ codebook is expressed as

$\begin{matrix} {{{W_{1}\left( {j,l,n,m,k} \right)} \in C_{1}} = {\left\{ {\begin{bmatrix} {{f_{n}\left( X^{(k)} \right)}{P_{1}(j)}} & 0 \\ 0 & {{g_{m}\left( X^{(k)} \right)}{P_{2}(l)}} \end{bmatrix}, {k = 0}, \ldots}\mspace{14mu} \right\} = \left\lbrack \begin{matrix} {{D(n)}\left( X^{(k)} \right){P_{1}(j)}} & 0 \\ 0 & {{D(m)}\left( X^{(k)} \right){P_{2}(l)}} \end{matrix} \right\rbrack}} & (32) \end{matrix}$

where P₁(j) and P₂(l) perform column permutations for the first and the second grid of beams, respectively.

Note that the permutation operation P(l) can be applied without beam shifting (e.g. D(m)).

Example 3 Phase Rotation

In another embodiment,

$\begin{matrix} {{{W_{1}\left( {n,m,k} \right)} \in C_{1}} = {\left\{ {\begin{bmatrix} {f_{n}\left( X^{(k)} \right)} & 0 \\ 0 & {g_{m}\left( X^{(k)} \right)} \end{bmatrix},{k = 0},\ldots} \right\} = \begin{bmatrix} X^{(k)} & 0 \\ 0 & {X^{(k)}{D(m)}} \end{bmatrix}}} & (33) \end{matrix}$

Alternatively,

$\begin{matrix} {C_{1} = \begin{bmatrix} {X^{(k)}{D(m)}} & 0 \\ 0 & X^{(k)} \end{bmatrix}} & (34) \end{matrix}$

D(m) (m=0, 1 . . . N−1) is a Nb×Nb diagonal matrix denoted as

$\begin{matrix} {D = {\begin{bmatrix} 1 & 0 & 0 & 0 \\ 0 & ^{j\frac{2\pi \; n}{N}} & 0 & 0 \\ 0 & 0 & \ldots & \mspace{11mu} \\ 0 & 0 & 0 & ^{j\frac{2\pi \; {({N_{b} - 1})}_{m}}{N}} \end{bmatrix}.}} & (35) \end{matrix}$

Herein D(m) performs phase correction to the Nb beams. For instance, as the first sub-matrix X^((k)) comprises Nb adjacent beams defined as:

b _((N) _(b) _(k)mod N) b _((N) _(b) _(k+1)mod N) . . . b _((N) _(b) _(k+N) _(b) _(−1)mod N),

the second sub-matrix D(m)X^((k)) comprises a different grid of Nb beams defined as

$\begin{matrix} b_{{({{N_{b}k} + m})}{modN}} & {^{j\frac{2{mn}}{N}}b_{{({{N_{b}k} + 1})}{modN}}} & \cdots & {^{j\frac{2\pi {({N_{b} - 1})}m}{N}}b_{{({{N_{b}k} + N_{b} - 1})}{modN}}} \end{matrix}.$

In other words, the m-th beam in the second grid (m=0, 1, . . . , Nb−1) is phase rotated by

$\frac{2{\pi \left( {N_{b} - 1} \right)}m}{N}$

degrees.

It is also possible to apply the phase rotation to both the first and the second grid of beams.

An alternative formulation of the phase rotation matrix D(m) is given as

$\begin{matrix} {D = \begin{bmatrix} 1 & 0 & 0 & 0 \\ 0 & ^{j\frac{\pi \;}{2N_{b}}} & 0 & 0 \\ 0 & 0 & \ldots & \mspace{11mu} \\ 0 & 0 & 0 & ^{j\frac{{{({N_{b} - 1})}\pi}\;}{2N_{b}}} \end{bmatrix}} & (36) \end{matrix}$

where Nb phase correction components (e.g., 1,

$\left. {^{j\frac{\pi}{2N_{b}}},{\ldots \mspace{14mu} ^{j\frac{{({N_{b} - 1})}\pi}{2N_{b}}}}} \right)$

uniformly sample a 90-degree sector. As such, co-phasing between two grids of beams is no longer limited to the QPSK alphabet as in the W2 codebook, but can take values of

$\left\{ {0,\frac{\pi}{2N_{b}},{\ldots \mspace{14mu} \frac{\left( {N_{b} - 1} \right)\pi}{2N_{b}}}} \right\} + {\left\{ {0,{\pi/2},\pi,,{3{\pi/2}},} \right\}.}$

It will be further understood that combination of beam shifting, beam permutation, and/or phase rotation schemes can be used in constructing the W₁ codebook.

Pruning the 8Tx Codebook for 4Tx MIMO

The LTE Release 10 8Tx codebook is designed using the GoB structure. Specifically:

-   -   each 4Tx polarization array is over-sampled by N DFT beams'     -   each wideband W₁ matrix comprises Nb adjacent DFT beams to cover         a certain AoD and angular spread, and     -   narrowband W₂ performs beam selection and co-phasing.

As such, the 4Tx GoB codebook components can be selected as sub-matrices of a subset of the 8Tx codebook in Release 12. In other words, each 4Tx GoB precoder may correspond to four selected rows of a Release 10 8Tx precoder (i.e., pruning the 8Tx codebook down to four rows).

To illustrate this pruning, the Release 10 8Tx codebook is denoted as

C ⁽⁸⁾ =C ₁ ⁽⁸⁾ ×C ₂ ⁽⁸⁾,

where C⁽⁸⁾={W⁽⁸⁾}, C₁ ⁽⁸⁾={W₁ ⁽⁸⁾} and C₂ ⁽⁸⁾={W₂ ⁽⁸⁾} are the first and second codebook.

Subsequently, the 4Tx GoB codebook can be written as

C ⁽⁴⁾ =={W ⁽⁴⁾ }=C ₁ ⁽⁴⁾ ×C ₂ ⁽⁴⁾,  (37)

where C⁽⁴⁾={W⁽⁴⁾}⊂{W⁽⁸⁾ _([(n1,n2,n3,n4);])}, and

where, for an 8×R matrix H, H_((n) _(i) _(;)) denotes the ni-th row of H,

${H_{\lbrack{{({{n\; 1},{n\; 2},{n\; 3},{n\; 4}})},:}\rbrack} = \begin{pmatrix} H_{({{n\; 1},:})} \\ H_{({{n2},:})} \\ H_{({{n\; 3},:})} \\ H_{({{n\; 4},:})} \end{pmatrix}},$

and (_(n1,n2,n3,n4)) is the row selection vector for codebook pruning.

The 4Tx GoB codebooks proposed above may be pruned from the Release 10 8Tx codebook. The following notations are used herein:

-   -   i₁ ⁴: index of first precoder W₁ for 4Tx     -   i₂ ⁴ index of second precoder W_(z) for 4Tx     -   i₁ ⁸ index of first precoder W₁ for 8Tx     -   i₂ ⁸ index of second precoder W₁ for 8Tx

As such, each 8Tx precoding matrix W⁽⁸⁾=W₁ ⁽⁸⁾W₂ ⁽⁸⁾ is denoted by a pair of 8Tx codebook indices (i₁ ⁸,i₂ ⁸), and each 4Tx precoding matrix W⁽⁴⁾=W₁ ⁽⁴⁾W₂ ⁽⁴⁾ is denoted by a pair of 4Tx codebook indices (i₁ ⁴,i₂ ⁴),

Rank-1

For a (N,Nb)=(N,Nb) 4Tx GoB codebook with overlapping beams, where N<=32, Nb=4, each 4Tx precoding matrix denoted by (i₁ ⁴,i₂ ⁴) can be pruned from a corresponding 8Tx rank-1 precoding matrix denoted by (i₁ ⁸,i₂ ⁸), where

${i_{1}^{4} = {\frac{32}{N}i_{1}^{8}}},\mspace{14mu} {i_{2}^{4} = i_{2}^{8}},\mspace{14mu} {i_{2}^{4} = 0},\ldots \mspace{14mu},15$

More specifically:

For (N,Nb)=(8,4) 4Tx codebook with overlapping, each 4Tx precoding matrix denoted by a pair of 4Tx codebook indices (i₁ ⁴,i₂ ⁴) can be pruned from a corresponding 8Tx rank-1 precoding matrix denoted by a pair of 8Tx codebook indices (i₁ ⁸,i₂ ⁸), as given in Table 7.

TABLE 7 i₁ ⁴ i₂ ⁴ 4Tx indices 0-3 0 1 2 3 4 5 6 7 i₁ ⁸ i₂ ⁸ Corresponding 8Tx 4^(i) ¹ ⁴ 0 1 2 3 4 5 6 7 indices i₁ ⁴ i₂ ⁴ 4Tx indices 0-3 8 9 10 11 12 13 14 15 i₁ ⁸ i₂ ⁸ Corresponding 8Tx 4^(i) ¹ ⁴ 8 9 10 11 12 13 14 15 indices

For a (N,Nb)=(16,4) 4Tx codebook with overlapping beams, each 4Tx precoding matrix denoted by (i₁ ⁴,i₂ ⁴) can be pruned from a corresponding 8Tx rank-1 precoding matrix denoted by (i₁ ⁸,i₂ ⁸), as given in Table 8.

TABLE 8 i₁ ⁴ i₂ ⁴ 4Tx indices 0-7 0 1 2 3 4 5 6 7 i₁ ⁸ i₂ ⁸ Corresponding 8Tx 2^(i) ¹ ⁴ 0 1 2 3 4 5 6 7 indices i₁ ⁴ i₂ ⁴ 4Tx indices 0-7 8 9 10 11 12 13 14 15 i₁ ⁸ i₂ ⁸ Corresponding 8Tx 2^(i) ¹ ⁴ 8 9 10 11 12 13 14 15 indices

For (N,Nb)=(32,4) 4Tx codebook with overlapping beams, each 4Tx precoding matrix denoted by (i₁ ⁴,i₂ ⁴) can be pruned from a corresponding 8Tx rank-1 precoding matrix denoted by (i₁ ⁸,i₂ ⁸), as given in Table 9.

TABLE 9 i₁ ⁴ i₂ ⁴ 4Tx indices 0-15 0 1 2 3 4 5 6 7 i₁ ⁸ i₂ ⁸ Corresponding 8Tx i₁ ⁴ 0 1 2 3 4 5 6 7 indices i₁ ⁴ i₂ ⁴ 4Tx indices 0-15 8 9 10 11 12 13 14 15 i₁ ⁸ i₂ ⁸ Corresponding 8Tx i₁ ⁴ 8 9 10 11 12 13 14 15 indices

For a (N,Nb)=(N,Nb) 4Tx codebook without overlapping beams, where N<=32, and Nb=4, each 4Tx precoding matrix denoted by a pair of 4Tx codebook indices (i₁ ⁴,i₂ ⁴) can be pruned from a corresponding 8Tx rank-1 precoding matrix denoted by a pair of 8Tx codebook indices (i₁ ⁸,i₂ ⁸), where

${i_{1}^{4} = {\frac{64}{N}i_{1}^{8}}},\mspace{14mu} {i_{2}^{4} = i_{2}^{8}},\mspace{11mu} {i_{2}^{4} = 0},\ldots \mspace{14mu},15.$

More specifically:

For a (N,Nb)=(8,4) 4Tx codebook without overlapping beams, each 4Tx precoding matrix denoted by (i₁ ⁴,i₂ ⁴) can be pruned from a corresponding 8Tx rank-1 precoding matrix denoted by (i₁ ⁸,i₂ ⁸) as given in Table 10.

TABLE 10 i₁ ⁴ i₂ ⁴ 4Tx indices 0-1 0 1 2 3 4 5 6 7 i₁ ⁸ i₂ ⁸ Corresponding 8Tx 8^(i) ¹ ⁴ 0 1 2 3 4 5 6 7 indices i₁ ⁴ i₂ ⁴ 4Tx indices 0-1 8 9 10 11 12 13 14 15 i₁ ⁸ i₂ ⁸ Corresponding 8Tx 8^(i) ¹ ⁴ 8 9 10 11 12 13 14 15 indices

For a (N,Nb)=(16,4) 4Tx codebook without overlapping beams, each 4Tx precoding matrix denoted by (i₁ ⁴,i₂ ⁴) can be pruned from a corresponding 8Tx rank-1 precoding matrix denoted by (i₁ ⁸,i₂ ⁸), as given in Table 11.

TABLE 11 i₁ ⁴ i₂ ⁴ 4Tx indices 0-3 0 1 2 3 4 5 6 7 i₁ ⁸ i₂ ⁸ Corresponding 8Tx 4^(i) ¹ ⁴ 0 1 2 3 4 5 6 7 indices i₁ ⁴ i₂ ⁴ 4Tx indices 0-3 8 9 10 11 12 13 14 15 i₁ ⁸ i₂ ⁸ Corresponding 8Tx 4^(i) ¹ ⁴ 8 9 10 11 12 13 14 15 indices

For a (N,Nb)=(32,4) 4Tx codebook without overlapping beams, each 4Tx precoding matrix denoted by (i₁ ⁴,i₂ ⁴) can be pruned from a corresponding 8Tx rank-1 precoding matrix denoted by (i₁ ⁸,i₂ ⁸), as given in Table 12.

TABLE 12 i₁ ⁴ i₂ ⁴ 4Tx indices 0-7 0 1 2 3 4 5 6 7 i₁ ⁸ i₂ ⁸ Corresponding 8Tx 2^(i) ¹ ⁴ 0 1 2 3 4 5 6 7 indices i₁ ⁴ i₂ ⁴ 4Tx indices 0-7 8 9 10 11 12 13 14 15 i₁ ⁸ i₂ ⁸ Corresponding 8Tx 2^(i) ¹ ⁴ 8 9 10 11 12 13 14 15 indices

Rank-2

Exemplary Codebook 1

In this section, we assume the following 4Tx rank-2 codebook, where the W₂ codebook is size-8.

$\begin{matrix} {{W_{1} = \begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}},} & (38) \end{matrix}$

where (k=0, . . . N/N_(b)−1) without overlapping beams, and (k=0, . . . 2N/N_(b)−1) with overlapping beams.

$\begin{matrix} {{{W_{2} \in {CB}_{2}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}}} \right\}},} & (39) \end{matrix}$

where (Y₁,Y₂)ε{(e₁ ⁴,e₁ ⁴),(e₂ ⁴,e₂ ⁴),(e₃ ⁴,e₃ ⁴),(e₄ ⁴,e₃ ⁴)}.

For a (N,Nb)=(N,Nb) 4Tx GoB codebook with overlapping beams, where N<=32, Nb=4, each 4Tx precoding matrix denoted by a pair of 4Tx codebook indices (i₁ ⁴,i₂ ⁴) can be pruned from a corresponding 8Tx rank-2 precoding matrix denoted by a pair of 8Tx codebook indices (i₁ ⁸,i₂ ⁸), where

${i_{1}^{4} = {\frac{32}{N}i_{1}^{8}}},\mspace{14mu} {i_{2}^{4} = i_{2}^{8}},\mspace{11mu} {i_{2}^{4} = 0},\ldots \mspace{14mu},7$

More specifically:

For a (N,Nb)=(8,4) 4Tx codebook with overlapping beams, each 4Tx precoding matrix denoted by (i₁ ⁴,i₂ ⁴) can be pruned from a corresponding 8Tx rank-2 precoding matrix denoted by (i₁ ⁸,i₂ ⁸), as given in Table 13.

TABLE 13 i₁ ⁴ i₂ ⁴ 4Tx indices 0-3 0 1 2 3 4 5 6 7 i₁ ⁸ i₂ ⁸ Corresponding 8Tx 4^(i) ¹ ⁴ 0 1 2 3 4 5 6 7 indices

For a (N,Nb)=(16,4) 4Tx codebook with overlapping beams, each 4Tx precoding matrix denoted by (i₁ ⁴,i₂ ⁴) can be pruned from a corresponding 8Tx rank-2 precoding matrix denoted by (i₁ ⁸,i₂ ⁸), as given in Table 14.

TABLE 14 i₁ ⁴ i₂ ⁴ 4Tx indices 0-7 0 1 2 3 4 5 6 7 i₁ ⁸ i₂ ⁸ Corresponding 8Tx 2^(i) ¹ ⁴ 0 1 2 3 4 5 6 7 indices

For a (N,Nb)=(32,4) 4Tx codebook with overlapping beams, each 4Tx precoding matrix denoted by (i₁ ⁴,i₂ ⁴) can be pruned from a corresponding 8Tx rank-2 precoding matrix denoted by (i₁ ⁸,i₂ ⁸), as given in Table 15.

TABLE 15 i₁ ⁴ i₂ ⁴ 4Tx indices 0-15 0 1 2 3 4 5 6 7 i₁ ⁸ i₂ ⁸ Corresponding 8Tx 2^(i) ¹ ⁴ 0 1 2 3 4 5 6 7 indices

For a (N,Nb)=(N,Nb) 4Tx codebook without overlapping beams, where N<=32, Nb=4, each 4Tx precoding matrix denoted by a pair of 4Tx codebook indices (i₁ ⁴,i₂ ⁴) can be pruned from a corresponding 8Tx rank-2 precoding matrix denoted by a pair of 8Tx codebook indices (i₁ ⁸,i₂ ⁸), where

${i_{1}^{4} = {\frac{64}{N}i_{1}^{8}}},\mspace{14mu} {i_{2}^{4} = i_{2}^{8}},\mspace{11mu} {i_{2}^{4} = 0},\ldots \mspace{14mu},7$

More specifically:

For a (N,Nb)=(8,4) 4Tx codebook without overlapping beams, each 4Tx precoding matrix denoted by (i₁ ⁴,i₂ ⁴) can be pruned from a corresponding 8Tx rank-2 precoding matrix denoted by (i₁ ⁸,i₂ ⁸), as given in Table 16.

TABLE 16 i₁ ⁴ i₂ ⁴ 4Tx indices 0-1 0 1 2 3 4 5 6 7 i₁ ⁸ i₂ ⁸ Corresponding 8Tx 8^(i) ¹ ⁴ 0 1 2 3 4 5 6 7 indices

For a (N,Nb)=(16,4) 4Tx codebook without overlapping beams, each 4Tx precoding matrix denoted by (i₁ ⁴,i₂ ⁴) can be pruned from a corresponding 8Tx rank-2 precoding matrix denoted by (i₁ ⁸,i₂ ⁸), as given in Table 17.

TABLE 17 i₁ ⁴ i₂ ⁴ 4Tx indices 0-3 0 1 2 3 4 5 6 7 i₁ ⁸ i₂ ⁸ Corresponding 8Tx 4^(i) ¹ ⁴ 0 1 2 3 4 5 6 7 indices

For a (N,Nb)=(32,4) 4Tx codebook without overlapping beams, each 4Tx precoding matrix denoted by (i₁ ⁴,i₂ ⁴) can be pruned from a corresponding 8Tx rank-2 precoding matrix denoted by (i₁ ⁸,i₂ ⁸), as given in Table 18.

TABLE 18 i₁ ⁴ i₂ ⁴ 4Tx indices 0-7 0 1 2 3 4 5 6 7 i₁ ⁸ i₂ ⁸ Corresponding 8Tx 2^(i) ¹ ⁴ 0 1 2 3 4 5 6 7 indices

Exemplary Codebook 2

In this section, we assume the following 4Tx GoB codebook where the W₂ codebook is size-16.

$\begin{matrix} {{W_{1} = \begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}},} & (40) \end{matrix}$

where (k=0, . . . N/N_(b)−1) without overlapping beams, and (k=0, . . . 2N/N_(b)−1) with overlapping beams.

$\begin{matrix} {{{W_{2} \in {C\; B_{2}}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}}} \right\}},{\left( {Y_{1},Y_{2}} \right) \in {\begin{Bmatrix} {\left( {e_{1}^{4},e_{1}^{4}} \right), \left( {e_{2}^{4},e_{2}^{4}} \right), \left( {e_{3}^{4}, e_{3}^{4}} \right), \left( {e_{4}^{4}, e_{4}^{4}} \right),} \\ { {\left( {e_{1}^{4},e_{2}^{4}} \right), \left( {e_{2}^{4},e_{3}^{4}} \right), \left( {e_{1}^{4},e_{4}^{4}} \right), \left( {e_{2}^{4},e_{4}^{4}} \right),}} \end{Bmatrix}.}}} & (41) \end{matrix}$

Such a 4Tx codebook cannot be completely pruned out of the 8Tx codebook unless the oversampling rate is N=32, which is equivalent to the 8Tx oversampling rate. In this case, when there is W₁ overlapping for 4Tx, each 4Tx precoding matrix denoted by a pair of 4Tx codebook indices (i₁ ⁴,i₂ ⁴) can be pruned from a corresponding 8Tx rank-2 precoding matrix denoted by a pair of 8Tx codebook indices (i₁ ⁸,i₂ ⁸), as given in Table 19, where

i ₁ ⁴ =i ₁ ⁸ ,i ₁ ⁴=0, . . . 15,

i ₂ ⁴ =i ₂ ⁸ ,i ₂ ⁴=0, . . . ,15

TABLE 19 i₁ ⁴ i₂ ⁴ 4Tx indices 0-15 0 1 2 3 4 5 6 7 i₁ ⁸ i₂ ⁸ Corresponding 8Tx i₁ ⁴ 0 1 2 3 4 5 6 7 indices i₁ ⁴ i₂ ⁴ 4Tx indices 0-15 8 9 10 11 12 13 14 15 i₁ ⁸ i₂ ⁸ Corresponding 8Tx i₁ ⁴ 8 9 10 11 12 13 14 15 indices

For a (N,Nb)=(32,4) 4Tx GoB codebook without overlapping beams, each 4Tx precoding matrix denoted by a pair of 4Tx codebook indices (i₁ ⁴,i₂ ⁴) can be pruned from a corresponding 8Tx rank-2 precoding matrix denoted by a pair of 8Tx codebook indices (i₁ ⁸,i₂ ⁸), as given in Table 20, where

i ₁ ⁴=2i ₁ ⁸ ,i ₁ ⁴=0, . . . ,7,

i ₁ ⁴ =i ₂ ⁸ ,i ₂ ⁴=0, . . . ,15

TABLE 20 4Tx indices i₁ ⁴ i₂ ⁴ 0-7 0 1 2 3 4 5 6 7 Corresponding 8Tx i₁ ⁸ i₂ ⁸ indices 2^(i) ₁ ⁴ 0 1 2 3 4 5 6 7 4Tx indices i₁ ⁴ i₂ ⁴ 0-7 8 9 10 11 12 13 14 15 Corresponding 8Tx i₁ ⁸ i₂ ⁸ indices 2^(i) ₁ ⁴ 8 9 10 11 12 13 14 15

Rank-3

A rank-3 4Tx GoB codebook cannot be pruned from the rank-3 8Tx codebooL This can be seen from the 8Tx design, which followed the (N,Nb)=(16,8) structure, where

$\begin{matrix} {\mspace{79mu} {{B = \begin{bmatrix} b_{0} & b_{1} & \cdots & b_{15} \end{bmatrix}},{\lbrack B\rbrack_{{l + m},{l + n}} = ^{j\frac{2\pi \; {mn}}{16}}},\mspace{20mu} {m = 0},1,2,3,{n = 0},1,\cdots,15}} & \; \\ {{X(k)} \in \begin{Bmatrix} \begin{bmatrix} {{b_{4{kmod}\; 32}\mspace{14mu} b_{{({{4k} + 1})}{mod}\; 32}\mspace{14mu} b_{{({{4k} + 2})}{mod}\; 32}\mspace{11mu} b_{{({{4k} + 3})}{mod}\; 32}b_{{({{4k} + 4})}{mod}\; 32}}\;} \\ {b_{{({{4k} + 5})}{mod}\; 32}\mspace{14mu} b_{{({{4k} + 6})}{mod}\; 32}\mspace{14mu} b_{{({{4k} + 7})}{mod}\; 32}} \end{bmatrix} \\ {{k = 0},{\ldots \mspace{14mu} 3}} \end{Bmatrix}} & \; \\ {{W_{1}^{(k)} = \begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}},{{{CodeBook}\; 1\text{:}\mspace{14mu} C_{1}} = \left\{ {W_{1}^{(0)},W_{1}^{(I)},W_{1}^{(2)},W_{1}^{(3)}} \right\}}} & (42) \\ {\mspace{79mu} {{{W_{2} \in {CB}_{2}} = \left\{ {\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}} \right\}},}} & (43) \\ {\left( {Y_{1},Y_{2}} \right) \in {\begin{Bmatrix} {\left( {e_{1}^{4},\left\lbrack {e_{1}^{4},e_{5}^{4}} \right\rbrack} \right),\left( {e_{2}^{4},\left\lbrack {e_{2}^{4},e_{6}^{4}} \right\rbrack} \right),\left( {e_{3}^{4},\left\lbrack {e_{3}^{4},e_{7}^{4}} \right\rbrack} \right),\left( {e_{4}^{4},\left\lbrack {e_{4}^{4},e_{8}^{4}} \right\rbrack} \right),} \\ {\left( {e_{5}^{4},\left\lbrack {e_{1}^{4},e_{5}^{4}} \right\rbrack} \right),\left( {e_{6}^{4},\left\lbrack {e_{2}^{4},e_{6}^{4}} \right\rbrack} \right),\left( {e_{7}^{4},\left\lbrack {e_{3}^{4},e_{7}^{4}} \right\rbrack} \right),\left( {e_{3}^{4},\left\lbrack {e_{4}^{4},e_{8}^{4}} \right\rbrack} \right),} \\ {\left( {\left\lbrack {e_{1}^{4},e_{5}^{4}} \right\rbrack,e_{1}^{4}} \right),\left( {\left\lbrack {e_{2}^{4},e_{6}^{4}} \right\rbrack,e_{2}^{4}} \right),\left( {\left\lbrack {e_{3}^{4},e_{7}^{4}} \right\rbrack,e_{3}^{4}} \right),\left( {\left\lbrack {e_{4}^{4},e_{8}^{4}} \right\rbrack,e_{4}^{4}} \right),} \\ {\left( {\left\lbrack {e_{1}^{4},e_{5}^{4}} \right\rbrack,e_{5}^{4}} \right),\left( {\left\lbrack {e_{2}^{4},e_{6}^{4}} \right\rbrack,e_{6}^{4}} \right),\left( {\left\lbrack {e_{3}^{4},e_{7}^{4}} \right\rbrack,e_{7}^{4}} \right),\left( {\left\lbrack {e_{4}^{4},e_{8}^{4}} \right\rbrack,e_{8}^{4}} \right),} \end{Bmatrix}.}} & (44) \end{matrix}$

The column vectors of each rank-3 8Tx precoding matrix comprise critically sampled (e.g. sampling rate 4) 4Tx DFT vectors in order to ensure that a rank-3 8Tx precoding matrix satisfies the unitary constraint. For 4Tx, in order to achieve the unitary constraint, column vectors of each rank-3 4Tx precoding matrix must comprise critically sampled (e.g. sampling rate 2) 2Tx DFT vectors. As such, the column vectors of any 4Tx GoB matrix will always span across different W₁ matrices of the 8Tx codebook, leaving it impossible to construct the rank-3 4-Tx codebook by pruning the 8Tx codebook.

However the rank-3 4Tx GoB component can be pruned from the rank-6 8Tx codebook, where

C ⁽⁴⁾ ={W ⁽⁴⁾}_(rank3) ⊂{W ⁽⁸⁾ _([(n1,n2,n3,n4),(m1,m2,m3)])}_(rank6)  (45)

e.g., the (_(n1,n2,n3,n4))-th row and _((m1,m2,m3))-th column of a rank-6 8Tx precoding matrix corresponding to a pair of codebook index (i₁ ⁸,i₂ ⁸) are used to construct a 4Tx precoding matrix corresponding to a pair of codebook indices (i₁ ⁴,i₂ ⁴).

For instance, for the (N,Nb)=(4,4) GoB codebook, the pruning shown in Table 21 is possible:

TABLE 21 4Tx indices i₁ ⁴ i₂ ⁴ 0 arbitrary Corresponding 8Tx i₁ ⁸ i₂ ⁸ indices 0 0

Note that the column-selection method _((m1,m2,m3)) may depend on the 4Tx GoB precoding matrix. For instance:

(Y ₁ Y ₂)ε{(e ₁ ⁴ ,[e ₁ ⁴ ,e ₃ ⁴])}

(m1,m2,m3)=(1,2,6)  (46)

(Y ₁ Y ₂)ε{(e ₃ ⁴ ,[e ₁ ⁴ ,e ₃ ⁴])}

(m1,m2,m3)=(5,2,6)  (47)

(Y ₁ Y ₂)ε{(e ₁ ⁴ ,[e ₃ ⁴ ,e ₁ ⁴])}

(m1,m2,m3)=(1,5,2)  (48)

(Y ₁ Y ₂)ε{(e ₁ ⁴ ,[e ₃ ⁴ ,e ₃ ⁴])}

(m1,m2,m3)=(1,5,6)  (49)

Rank-4

Similarly, the rank-4 4Tx GoB component cannot be pruned from the rank-4 8Tx codebook. However, a rank-4 4Tx GoB component can be pruned from the rank-8 8Tx codebook, where

C ⁽⁴⁾ ={W ⁽⁴⁾}_(rank-4) ⊂{W ⁽⁸⁾ _([(n1,n2,n3,n4),(m1,m2,m3,m4)])}_(rank-8)  (50)

e.g., the (_(n1,n2,n3,n4))-th row and _((m1,m2,m3,m4))-th column of a rank-8 8Tx precoding matrix corresponding to a pair of codebook index (i₁ ⁸,i₂ ⁸) is used to construct a 4Tx precoding matrix corresponding to a pair of codebook indices (i₁ ⁴,i₂ ⁴). For instance for the (N,Nb)=(4,4) GoB codebook, the pruning shown in Table 22 is possible.

TABLE 22 4Tx indices i₁ ⁴ i₂ ⁴ 0 arbitrary Corresponding 8Tx i₁ ⁸ i₂ ⁸ indices 0 0

Note that the column-selection method _((m1,m2,m3,m4)) may depend on the 4Tx GoB precoding matrix. For instance:

(Y ₁ Y ₂)ε{([e ₁ ⁴ ,e ₃ ⁴ ],[e ₁ ⁴ ,e ₃ ⁴])}

(m1,m2,m3,m4)=(1,5,2,6)  (51)

(Y ₁ Y ₂)ε{([e ₂ ⁴ ,e ₄ ⁴ ],[e ₂ ⁴ ,e ₄ ⁴])}

(m1,m2,m3,m4)=(3,7,4,8)  (52)

(Y ₁ Y ₂)ε{([e ₁ ⁴ ,e ₃ ⁴ ],[e ₂ ⁴ ,e ₄ ⁴])}

(m1,m2,m3,m4)=(1,5,4,8)  (53)

(Y ₁ Y ₂)ε{([e ₂ ⁴ ,e ₄ ⁴ ],[e ₁ ⁴ ,e ₃ ⁴])}

(m1,m2,m3,m4)=(3,7,2,6)  (54)

Row Selection Vector (n1,n2,n3,n4) for Pruning

In one embodiment, the row selection vector (_(n1,n2,n3,n4)) is hard-coded/fixed in the specification, and is not signalled to the UE. FIG. 5 illustrates an example of using a row selection vector to prune antenna pairs in an 8Tx array. Eight antennas 1-8 are arranged in four cross-polarized pairs 501-504. Using the row selection vector (_(n1,n2,n3,n4))=_([1,2,5,6]) prunes the first two cross-polarized antenna pairs 501, 502 from the 8Tx array 505 for a 4Tx deployment 506.

In another embodiment, the row selection vector (_(n1,n2,n3,n4)) may be semi-statically radio resource control (RRC)-configured for a UE, and can be different for different UEs. There are multiple possible methods for RRC signalling (_(n1,n2,n3,n4))

Example 1

For the k-th antenna port of a 4-Tx MIMO system (k=1, 2, 3, 4), the eNodeB signals the corresponding virtual antenna port Index n_(k) in an 8-Tx MIMO system. This requires a signaling overhead of log 2(8)×4=12 bits.

Example 2

As there are a total of C₄ ⁸=70 ways of choosing 4-antenna ports out of an 8-antenna port system, log 2(70)=7-bits are used to signal the combinatorial index of the antenna selection vector (_(n1,n2,n3,n4)). This achieves 5-bits of overhead savings.

It is further possible to down-size the set of candidate antenna selection vectors {_((n1,n2,n3,n4))}, which may further reduce the RRC signalling overhead. For instance, the eNodeB may use 1-bit to configure the UE to assume (_(n1,n2,n3,n4))=_([1,2,5,6]) or (_(n1,n2,n3,n4))=_([1,4,5,8]). With (_(n1,n2,n3,n4))=_([1,4,5,6]), two adjacent cross-polarized antenna pairs are configured, which models 4Tx cross-polarized antennas with small antenna spacing. With (_(n1,n2,n3,n4))=_([1,4,5,8]), two antenna pairs with large antenna spacing are modelled. This may be important for some wireless operators that must deploy wide antenna spacing due to their GSM/HSPA/LTE spectrum farming limitation, where two separate antenna radomes with large spacing are used for 4Tx MIMO.

For a UE configured in transmission mode 10, where the UE is configured with multiple CSI-RS resources, the row selection vector (_(n1,n2,n3,n4)) can be independently configured for each 4-Tx CSI-RS resource.

Example of 4Tx Codebook from 8Tx Pruning

Using the methods proposed above for rank-1,2,3,4Tx GoB codebooks, one example of a 4Tx codebook is summarized below.

Release 12 enhancement is achieved by augmenting the Release 8 codebook with double-codebook (DCB) components.

-   -   component 1 (Release 8): W1=identity matrix, W2 selected from         Release 8 codebook,     -   component 2 (DCB): . . . pruned Release 10 8Tx codebook,         -   select four rows out of eight rows from the 8Tx precoding             matrices (i.e., a subset of the 8Tx matrices).

Rank-1:

Component 1: Release 8

W ₁ =I ₄,  (55)

W ₂ εC _(2,R8-4Tx-R1)  (56)

Component 2: DCB:

-   -   W₁: i₁=0, . . . 15, each W₁ is the (1,2,5,6)^(th) row of the         (i₁)^(th) 8Tx W₁ codebook.     -   W₂: i₂=0, . . . 15, same as 8Tx W2 codebook     -   Note: the 4Tx DCB components are the (1,2,5,6)^(th) row of the         8Tx DCB codebook. This is equivalent to a (N,Nb)=(32,4) codebook         with adjacent W₁ overlapping.

Rank-2:

Component 1: Release 8

W ₁ =I ₄,  (57)

W ₂ εC _(2,R8-4Tx-R2)  (58)

Component 2: DCB:

-   -   W1:i₁=0, . . . 15, each W₁ is the (1,2,5,6)^(th) row of the         (i₁)^(th) 8Tx W₁ codebook.     -   W2: i₂=0, . . . 15, same as 8Tx W₂ codebook.     -   Note: the 4Tx DCB components are the (1,2,5,6) row of the 8Tx         DCB codebook. This is equivalent to a (N,Nb)=(32,4) codebook         with adjacent W₁ overlapping.

Rank-3/4:

Re-use the Release 8 codebook.

Further Enhancement of 4Tx Codebook

Any of the codebooks proposed above can be further enhanced by adding more 4Tx precoding matrices. Note that in the sections above, the Release 8 4Tx codebook is inherited in Release 12 4Tx codebook in the form of W=W₁W₂, where W₁ is a 4×4 identity matrix and W₂ are taken from Release 8 codebook. An extension of this design is possible, where the W₁ codebook not only includes the 4×4 identity matrix I₄, but also includes other size 4×4 matrices. One exemplary extension is where the W₁ codebook comprises of a set of diagonal matrices, where each diagonal element performs phase rotation for each row of W₂ matrix.

Following this design principle, an example of a further-enhanced 4Tx codebook is given below.

Rank-1/2

C ₁ ={W ₁ ⁽⁰⁾ ,W ₁ ⁽¹⁾ ,W ₁ ⁽²⁾ , . . . ,W ₁ ^(N−1)},  (59)

where:

For i=0, . . . , N/2−1, W₁ ⁽⁰⁾, W₁ ⁽¹⁾, W₁ ⁽²⁾ . . . W₁ ^((N/2−1)) are diagonal matrices (e.g. performing phase rotation), and W₂ inherits the Release 8 4Tx codebook. In particular, for i₁=0, W₁ ⁽⁰⁾=I₄. This allows the Release 8 codebook to be re-used without change in Release 12.

When i₁=(N/2), . . . , N−1, then W₁ ^((N/2)) . . . W₁ ^((N−1)) are block diagonal matrices designed with double-codebook structure. In this case, W₁ and W₂ can use any of the DCB codebook components proposed in the sections above. As one example, W₁/W₂ may be pruned 8Tx codebooks, where N=32, and

-   -   W₁: i₁=16, . . . 31, each W₁ is the (1,2,5,6)^(th) row of the         (i₁−15)^(th) 8Tx W₁ matrix,     -   W₂: i₂=0, . . . 15, same as 8Tx W₂ codebook.

Herein, the W₁ overhead is 5-bit, and W₂ overhead is 4-bits per subband.

Rank-3 and rank-4 may follow the same enhancement design if necessary.

Alternative Design for Rank-2

The GoB designs proposed above assumed that each W₁ matrix comprises a group of adjacent DFT beams. It is noted that the beams in each W₁ grid are not necessarily adjacent, which makes other designs possible. In this section we propose an example rank-2 design with non-adjacent beams in W₁.

To recapture the notations, note that

$\begin{matrix} {{W_{1}^{(k)} = \begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}},} & (60) \end{matrix}$

where X^((k)) comprises of multiple 2×1 DFT beams, k=i₁. In the following section, we assume an over-sampling ratio N=16, but the proposed design can be easily generalized to other N values.

Alternative Design 1

It is noted that an N-times oversampled 2×1 DFT beam expressed as

${b_{lmodN} = \begin{bmatrix} 1 \\ ^{{j2\pi}\; {l/N}} \end{bmatrix}},{l = 0},{{\ldots \mspace{14mu} N} - 1}$

is orthogonal to

b _((l+N/2)mod N*)

Therefore each W₁ grid may comprise two orthogonal DFT beams expressed as

$\begin{matrix} {{W_{1}^{(k)} = \begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}},} & (61) \\ {{X_{(k)} = \left\lbrack {b_{{lmodN},}b_{{({l + {N/2}})}{modN}}} \right\rbrack},{k = 1.}} & (62) \end{matrix}$

The W₂ codebook may comprise beam selection and co-phasing matrixes, for example, denoted as:

$\begin{matrix} {W_{2} = {C_{2} = {\Omega \circ \left\{ {\begin{pmatrix} e_{1} & e_{2} \\ e_{1} & e_{2} \end{pmatrix},\begin{pmatrix} e_{1} & e_{2} \\ e_{1} & {- e_{2}} \end{pmatrix},\begin{pmatrix} e_{1} & e_{2} \\ {- e_{1}} & e_{2} \end{pmatrix},\begin{pmatrix} e_{1} & e_{2} \\ {- e_{1}} & {- e_{2}} \end{pmatrix}} \right\}}}} & (63) \end{matrix}$

where ∘ denotes the Schur product, e_(i) ² is a 2×1 column vector with all zero entries except the i-th element being 1, and

$\begin{matrix} {\Omega = \left\{ \begin{pmatrix} I_{2} & \; \\ \; & {^{{j2\pi}\; {k/N}}I_{2}} \end{pmatrix} \right\}_{k = \Xi}} & (64) \end{matrix}$

are diagonal matrices that perform co-phasing.

As an example,

$\begin{matrix} {{\Omega = \left\{ {\begin{pmatrix} I_{2} & \; \\ \; & I_{2} \end{pmatrix},\begin{pmatrix} I_{2} & \; \\ \; & {- I_{2}} \end{pmatrix},\begin{pmatrix} I_{2} & \; \\ \; & {j\; I_{2}} \end{pmatrix},\begin{pmatrix} I_{2} & \; \\ \; & {{- j}\; I_{2}} \end{pmatrix},} \right\}},} & (65) \end{matrix}$

which results in a 4-bits W₂ codebook. Correspondingly, for each X^((k))=[b_(l mod N),b_((l+N/2)mod N)], k=l=i₁, the corresponding sixteen composite matrices W=W_(i) ₁ _(,j) ₂ , i₂=0, . . . 15 are expressed as shown in Table 23.

TABLE 23 i₂ = 0, . . . , 3 $W_{k,0} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \end{pmatrix}$ $W_{k,1} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ b_{l\; {mod}\; N} & {- b_{{({l + {N/2}})}\; {mod}\; N}} \end{pmatrix}$ $W_{k,2} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ {- b_{l\; {mod}\; N}} & b_{{({l + {N/2}})}\; {mod}\; N} \end{pmatrix}$ $W_{k,3} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ {- b_{l\; {mod}\; N}} & {- b_{{({l + {N/2}})}\; {mod}\; N}} \end{pmatrix}$ i₂ = 4, . . . , 7 $W_{k,4} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ {- b_{l\; {mod}\; N}} & {- b_{{({l + {N/2}})}\; {mod}\; N}} \end{pmatrix}$ $W_{k,5} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ {- b_{l\; {mod}\; N}} & b_{{({l + {N/2}})}\; {mod}\; N} \end{pmatrix}$ $W_{k,6} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ b_{l\; {mod}\; N} & {- b_{{({l + {N/2}})}\; {mod}\; N}} \end{pmatrix}$ $W_{k,7} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \end{pmatrix}$ i₂ = 8, . . . , 11 $W_{k,8} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ {jb}_{l\; {mod}\; N} & {jb}_{{({l + {N/2}})}\; {mod}\; N} \end{pmatrix}$ $W_{k,9} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ {jb}_{l\; {mod}\; N} & {- {jb}_{{({l + {N/2}})}\; {mod}\; N}} \end{pmatrix}$ $W_{k,10} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ {- {jb}_{l\; {mod}\; N}} & {jb}_{{({l + {N/2}})}\; {mod}\; N} \end{pmatrix}$ $W_{k,11} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ {- {jb}_{l\; {mod}\; N}} & {- {jb}_{{({l + {N/2}})}\; {mod}\; N}} \end{pmatrix}$ i₂ = 12, . . . , 15 $W_{k,12} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ {- {jb}_{l\; {mod}\; N}} & {- {jb}_{{({l + {N/2}})}\; {mod}\; N}} \end{pmatrix}$ $W_{k,13} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ {- {jb}_{l\; {mod}\; N}} & {jb}_{{({l + {N/2}})}\; {mod}\; N} \end{pmatrix}$ $W_{k,14} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ {jb}_{l\; {mod}\; N} & {- {jb}_{{({l + {N/2}})}\; {mod}\; N}} \end{pmatrix}$ $W_{k,15} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ {jb}_{l\; {mod}\; N} & {jb}_{{({l + {N/2}})}\; {mod}\; N} \end{pmatrix}$

It is noted that W_(i) ₁ _(,j) ₂ , i₂=4, . . . 7 are identical to W_(i) ₁ _(,j) ₂ , i₂=0, . . . 3, and W_(i) ₁ _(,j) ₂ , i₂=12, . . . 15 are identical to W_(i) ₁ _(,j) ₂ , i₂=8, . . . 11. Therefore it's possible to reduce the W₂ size to 3-bits (i₂=0, . . . 7), where

$\begin{matrix} {{\Omega = \left\{ {\begin{pmatrix} I_{2} & \; \\ \; & I_{2} \end{pmatrix},\begin{pmatrix} I_{2} & \; \\ \; & {j\; I_{2}} \end{pmatrix}} \right\}},} & (66) \end{matrix}$

and the composite precoder W=W_(i) ₁ _(,j) ₂ is given by the values shown in Table 24.

TABLE 24 i₂ = 0, . . . , 3 $W_{k,0} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \end{pmatrix}$ $W_{k,1} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ b_{l\; {mod}\; N} & {- b_{{({l + {N/2}})}\; {mod}\; N}} \end{pmatrix}$ $W_{k,2} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ {- b_{l\; {mod}\; N}} & b_{{({l + {N/2}})}\; {mod}\; N} \end{pmatrix}$ $W_{k,3} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ {- b_{l\; {mod}\; N}} & {- b_{{({l + {N/2}})}\; {mod}\; N}} \end{pmatrix}$ i₂ = 4, . . . , 7 $W_{k,4} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ {jb}_{l\; {mod}\; N} & {jb}_{{({l + {N/2}})}\; {mod}\; N} \end{pmatrix}$ $W_{k,5} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ {jb}_{l\; {mod}\; N} & {- {jb}_{{({l + {N/2}})}\; {mod}\; N}} \end{pmatrix}$ $W_{k,6} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ {- {jb}_{l\; {mod}\; N}} & {jb}_{{({l + {N/2}})}\; {mod}\; N} \end{pmatrix}$ $W_{k,7} = \begin{pmatrix} b_{l\; {mod}\; N} & b_{{({l + {N/2}})}\; {mod}\; N} \\ {- {jb}_{l\; {mod}\; N}} & {- {jb}_{{({l + {N/2}})}\; {mod}\; N}} \end{pmatrix}$

Note that other co-phasing methods Ω are possible, for example

$\begin{matrix} {\Omega = {\left\{ {\begin{pmatrix} I_{2} & \; \\ \; & I_{2} \end{pmatrix},\begin{pmatrix} I_{2} & \; \\ \; & {j\; I_{2}} \end{pmatrix},\begin{pmatrix} I_{2} & \; \\ \; & {^{j\frac{n}{4}}I_{2}} \end{pmatrix},\begin{pmatrix} I_{2} & \; \\ \; & {^{j\frac{3\pi}{4}}I_{2}} \end{pmatrix},} \right\}.}} & (67) \end{matrix}$

In this case, the W₂ codebook size is 4-bits.

Generalization

The precoders proposed above as alternative design 1 may be combined with the precoders in the previous sections to construct the final rank-2 codebook. For example, assuming over-sampling ratio N (e.g. N=16), N_(b)=4, the rank-2 codebook may be expressed as

$\begin{matrix} {{{W_{1} \in C_{1}} = \left\{ {\begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}.} \right\}},{i_{1} = {k = 0}},{{\ldots \mspace{14mu} 2N\text{/}N_{b}} - 1}} & (68) \end{matrix}$

->size N/2

When i₂=0, . . . ,7:

$\begin{matrix} {X^{(k)} = \left\lfloor \begin{matrix} {b_{{({N_{b}{k/2}})}{modN}}\;} & b_{{({{N_{b}{k/2}} + 1})}{modN}} & \mspace{11mu} & {\; {\ldots \mspace{11mu} b_{{({{N_{b}{k/2}} + N_{k} - 1})}{modN}}}} \end{matrix} \right\rfloor} & (69) \\ {{{W_{2} \in {CB}_{2}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}}} \right\}},} & (70) \\ {\left( {Y_{1},Y_{2}} \right) \in \left\{ {\left( {e_{1}^{4},e_{1}^{4}} \right),\left( {e_{2}^{4},e_{2}^{4}} \right),\left( {e_{3}^{4},e_{3}^{4}} \right),\left( {e_{4}^{4},e_{4}^{4}} \right)} \right\}} & (71) \end{matrix}$

When i₂=8, . . . , 15:

$\begin{matrix} {\mspace{79mu} {X^{(k)} = \left\lfloor {b_{{({k - {N/2}})}{modN}}\begin{matrix} , & b_{k\mspace{11mu} {mod}\mspace{11mu} N} \end{matrix}} \right\rfloor}} & (72) \\ {{{W_{2} \in {CB}_{2}} = {\frac{1}{\sqrt{2}} \times \begin{Bmatrix} {\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & Y_{2} \end{bmatrix},\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix},\begin{bmatrix} Y_{1} & Y_{2} \\ {- Y_{1}} & Y_{2} \end{bmatrix},\begin{bmatrix} Y_{1} & Y_{2} \\ {- Y_{1}} & {- Y_{2}} \end{bmatrix},} \\ {\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {j\; Y_{2}} \end{bmatrix},\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix},{\begin{bmatrix} Y_{1} & Y_{2} \\ {{- j}\; Y_{1}} & {j\; Y_{2}} \end{bmatrix}\begin{bmatrix} Y_{1} & Y_{2} \\ {{- j}\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}},} \end{Bmatrix}}},} & (73) \\ {\mspace{79mu} {\left( {Y_{1},Y_{2}} \right) \in \left\{ \left( {e_{1}^{2},e_{2}^{2}} \right) \right\}}} & (74) \end{matrix}$

The W₁ overhead is log 2(N/2)=3-bits, and the W₂ overhead is 4-bits.

Note that the combined codebook can be re-expressed below.

$\begin{matrix} {{W_{1} \in C_{1}} = \left\{ {\begin{bmatrix} X^{(0)} & 0 \\ 0 & X^{(0)} \end{bmatrix},{\ldots \mspace{14mu}\begin{bmatrix} X^{({N - 1}} & 0 \\ 0 & X^{({N - 1})} \end{bmatrix}}} \right\}} & (75) \\ \left. \rightarrow{{size}\mspace{14mu} N} \right. & \; \\ {{{When}\mspace{11mu} W_{1}} = {{\begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}\left( {{k = {i_{1} = 0}},{{\ldots \mspace{14mu} {N/2}} - 1}} \right)}:}} & (76) \\ {X^{(k)} = \left\lfloor \begin{matrix} {b_{{({N_{b}{k/2}})}{modN}}\;} & b_{{({{N_{b}{k/2}} + 1})}{modN}} & {\mspace{11mu} \ldots} & {\mspace{14mu} b_{{({{N_{b}{k/2}} + N_{k} - 1})}{modN}}} \end{matrix} \right\rfloor} & (77) \\ {{{W_{2} \in {CB}_{2}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}}} \right\}},} & (78) \\ {\left( {Y_{1},Y_{2}} \right) \in \left\{ {\left( {e_{1}^{4},e_{1}^{4}} \right),\left( {e_{2}^{4},e_{2}^{4}} \right),\left( {e_{3}^{4},e_{3}^{4}} \right),\left( {e_{4}^{4},e_{4}^{4}} \right)} \right\}} & (79) \end{matrix}$

$\begin{matrix} {\mspace{79mu} {{{When}\mspace{11mu} W_{1}} = {{\begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}\left( {{k = {i_{1} = \frac{N}{2}}},\ldots \mspace{14mu},{N - 1}} \right)}:}}} & (80) \\ {\mspace{79mu} {X^{(k)} = \left\lfloor {b_{{({k - {N/2}})}{modN}},b_{k\mspace{11mu} {modN}}} \right\rfloor}} & (81) \\ {{{W_{2} \in {CB}_{2}} = {\frac{1}{\sqrt{2}} \times \begin{Bmatrix} {\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & Y_{2} \end{bmatrix},\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix},\begin{bmatrix} Y_{1} & Y_{2} \\ {- Y_{1}} & Y_{2} \end{bmatrix},\begin{bmatrix} Y_{1} & Y_{2} \\ {- Y_{1}} & {- Y_{2}} \end{bmatrix},} \\ {\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {j\; Y_{2}} \end{bmatrix},\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix},{\begin{bmatrix} Y_{1} & Y_{2} \\ {{- j}\; Y_{1}} & {j\; Y_{2}} \end{bmatrix}\begin{bmatrix} Y_{1} & Y_{2} \\ {{- j}\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}},} \end{Bmatrix}}},} & (82) \\ {\mspace{79mu} {\left( {Y_{1},Y_{2}} \right) \in \left\{ \left( {e_{1}^{2},e_{2}^{2}} \right) \right\}}} & (83) \end{matrix}$

In this case, the W₁ overhead is log 2(N)=4-bits, and the W₂ overhead is 3-bits.

Another possible combinatorial design is

$\begin{matrix} \begin{matrix} {{W_{1} \in C_{1}} = \left\{ {\begin{bmatrix} X^{(0)} & 0 \\ 0 & X^{(0)} \end{bmatrix},{\ldots \mspace{14mu}\begin{bmatrix} X^{({N - 1}} & 0 \\ 0 & X^{({N - 1})} \end{bmatrix}}} \right\}} \\ \left. \rightarrow{{size}\mspace{14mu} N} \right. \end{matrix} & (84) \\ {{{When}\mspace{11mu} W_{1}} = {{\begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}\left( {{k = {i_{1} = 0}},{{\ldots \mspace{14mu} {N/2}} - 1}} \right)}:}} & (85) \\ {X^{(k)} = \left\lfloor \begin{matrix} {b_{{({N_{b}{k/2}})}{modN}}\;} & b_{{({{N_{b}{k/2}} + 1})}{modN}} & {\mspace{11mu} \ldots} & {\mspace{14mu} b_{{({{N_{b}{k/2}} + N_{k} - 1})}{modN}}} \end{matrix} \right\rfloor} & (86) \\ {{{W_{2} \in {CB}_{2}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}}} \right\}},} & (87) \\ {\left( {Y_{1},Y_{2}} \right) \in {\quad\left\{ {\left( {e_{1}^{4},e_{1}^{4}} \right), \left( {e_{2}^{4}, e_{2}^{4}} \right), \left( {e_{3}^{4}, e_{3}^{4}} \right),{\left( {e_{4}^{4},e_{4}^{4}} \right) \left( {e_{1}^{4},e_{2}^{4}} \right)}, \left( {e_{2}^{4},e_{3}^{4}} \right), \left( {e_{1}^{4},e_{4}^{4}} \right),\left( {e_{2}^{4},e_{4}^{4}} \right)} \right\}}} & (88) \\ {{{When}\mspace{11mu} W_{1}} = {{\begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}\left( {{k = {i_{1} = \frac{N}{2}}},\ldots \mspace{14mu},{N - 1}} \right)}:}} & (89) \\ {X^{(k)} = \left\lfloor {b_{{({k - {N/2}})}{modN}},b_{k\mspace{11mu} {modN}}} \right\rfloor} & (90) \\ {{{W_{2} \in {CB}_{2}} = {\frac{1}{\sqrt{2}} \times \begin{Bmatrix} {\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & Y_{2} \end{bmatrix},} & {\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix},} \\ {\begin{bmatrix} Y_{1} & Y_{2} \\ {- Y_{1}} & Y_{2} \end{bmatrix},} & {\begin{bmatrix} Y_{1} & Y_{2} \\ {- Y_{1}} & {- Y_{2}} \end{bmatrix},} \\ {\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {j\; Y_{2}} \end{bmatrix},} & {\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix},} \\ {\begin{bmatrix} Y_{1} & Y_{2} \\ {{- j}\; Y_{1}} & {j\; Y_{2}} \end{bmatrix},} & {\begin{bmatrix} Y_{1} & Y_{2} \\ {{- j}\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix},} \\ {\begin{bmatrix} Y_{1} & Y_{2} \\ {^{j\frac{\pi}{4}}Y_{1}} & {{- ^{j\frac{\pi}{4}}}Y_{2}} \end{bmatrix},} & {\begin{bmatrix} Y_{1} & Y_{2} \\ {{- ^{j\frac{\pi}{4}}}Y_{1}} & {^{j\frac{\pi}{4}}Y_{2}} \end{bmatrix},} \\ \begin{bmatrix} Y_{1} & Y_{2} \\ {{- j}\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix} & {\begin{bmatrix} Y_{1} & Y_{2} \\ {{- ^{j\frac{\pi}{4}}}Y_{1}} & {{- ^{j\frac{\pi}{4}}}Y_{2}} \end{bmatrix},} \\ {\begin{bmatrix} Y_{1} & Y_{2} \\ {^{j\frac{3\pi}{4}}Y_{1}} & {^{j\frac{3\pi}{4}}Y_{2}} \end{bmatrix},} & {\begin{bmatrix} Y_{1} & Y_{2} \\ {^{j\frac{3\pi}{4}}Y_{1}} & {{- ^{j\frac{3\pi}{4}}}Y_{2}} \end{bmatrix},} \\ {\begin{bmatrix} Y_{1} & Y_{2} \\ {{- ^{j\frac{3\pi}{4}}}Y_{1}} & {^{j\frac{3\pi}{4}}Y_{2}} \end{bmatrix},} & {\begin{bmatrix} Y_{1} & Y_{2} \\ {{- ^{j\frac{3\pi}{4}}}Y_{1}} & {{- ^{j\frac{3\pi}{4}}}Y_{2}} \end{bmatrix},} \end{Bmatrix}}},} & (91) \\ {\left( {Y_{1},Y_{2}} \right) \in \left\{ \left( {e_{1}^{2},e_{2}^{2}} \right) \right\}} & (92) \end{matrix}$

The W₁ overhead is log 2(N)=4-bits, and the W₂ overhead is 4-bits.

Inheritance of the Release 8 Codebook in Release 12

Using Release 8 Precoders for W₂

As proposed in the previous sections, it is possible for the Release 12 codebook to inherit the Release 8 codebook as a subset. This can be achieved by using the Release 8 4Tx precoder as the codebook for W₂ which is associated with W₁=4×4 identity matrix I₄. This is applicable for rank-1 to rank-4, where the subband W₂ overhead is 4-bits per subband.

It is also possible to divide the Release 8 precoders into N groups, where each group has 16/N Release 8 precoders that form a different W₂ codebook. For each W₂ codebook, the W₁ matrix is equivalent to a 4×4 identity matrix. The subband W₂ overhead will therefore be reduced to log 2(16/N) bits.

For example:

-   -   The Release 8 codebook is inherited in Release 12 codebook,         corresponding to two W₁ matrices, e.g., W₁ ^(k)=I₄, k=0, 1, For         W₁ ⁰, the W2 codebook comprises the first eight Release 8         precoders. For W₁ ¹, the W₂ codebook comprises the last eight         Release 8 precoders.     -   Other values of N are possible to adapt the subband PMI         bit-width. For example, N=2 corresponds to a subband size of log         2(8)=3-bits, N=4 corresponds to a subband size of log 2(4)=2         bits.     -   The above designs can be applied for rank-1, rank-2, rank-3, and         rank-4.

Constructing W₁ with Release 8 Precoders and W₂ with Column Selection

It is further possible to inherit the Release 8 codebook in Release 12 by constructing the W₁ matrix with Release 8 precoders, and constructing the W₂ codebook with column selection matrices.

For example:

-   -   For rank-1, W₁ includes all or a subset of Release 8 rank-1         vectors. The size of W₁ is given by 4×L, where 1<=L<=16 is the         number of rank-1 Release 8 codebook vectors that are included in         W₁. The W₂ codebook comprises L column-selection vectors [e₁, e₂         . . . e_(L)], where e_(i) is an L×1 vector of all zero entries,         except for the i-th entry, which is equivalent to 1.     -   For rank-r (r=2, 3, 4), the columns of W₁ comprise all or a         subset of Release 8 rank-r vectors, e.g. this may be denoted as

$\begin{matrix} {W_{1} = \left\lfloor \begin{matrix} W_{s{(0)}}^{{ReI}{.8}\text{-}{rank}\text{-}r} & W_{s{(1)}}^{{ReI}{.8}\text{-}{rank}\text{-}r} & \begin{matrix} \ldots & W_{s{({L - 1})}}^{{ReI}{.8}\text{-}{rank}\text{-}r} \end{matrix} \end{matrix} \right\rfloor} & (93) \end{matrix}$

where W_(s(l)) ^(Rel.8-rank-4) is the s(l)-th Release 8 precoder. The size of W₁ is 4×rL, where 1<=L<=16 is the number of rank-r Release 8 codebook matrices in W₁. The W₂ codebook comprises L column-selection matrices, where the l-th W₂ matrix (1<=1<=L) is

$\begin{matrix} {{W\; 2} = \begin{bmatrix} 0_{{r{({l - 1})}} \times r} \\ I_{r \times r} \\ 0_{{r{({L - 1})}} \times r} \end{bmatrix}} & (94) \end{matrix}$

Alternatively, the W₁ matrix can be constructed in a block diagonal manner.

For example, for rank-1:

$\begin{matrix} {{W_{1} = \begin{bmatrix} A & 0 \\ 0 & B \end{bmatrix}},} & (95) \end{matrix}$

where A and B are of sizes 2×16, where the 1-th column of A is the first two rows of the l-th Release 8 precoder, and the 1-th column of B is the last two rows of the l-th Release 8 precoder, l=1, . . . , 16.

The W2 matrix can be written in the form of

$\begin{matrix} {{W_{2}^{k} = \begin{bmatrix} e_{k} & 0 \\ 0 & e_{k} \end{bmatrix}},{k = 1},\ldots \mspace{14mu},16,} & (96) \end{matrix}$

where e_(k) is the k-th column of a 16×16 identity matrix.

For rank-r, r=2, . . . , 4:

$\begin{matrix} {{W_{1} = \begin{bmatrix} A & 0 \\ 0 & B \end{bmatrix}},} & (97) \end{matrix}$

where A and B are of sizes 2×16r, and where

-   -   A=[W₁ ^(Rel.8-rank-r) W₂ ^(Rel.8-rank-r) . . . W₁₆         ^(Rel.8-rank-r)]_((1:2)), P_((t:2)) is the first and second row         of matrix P, and     -   B=[W₁ ^(Rel.8-rank-r) W₂ ^(Rel.8-rank-r) . . . W₁₆         ^(Rel.8-rank-r)]_((3:4)), is the third and fourth row of matrix         P.

For the W₂ codebook,

$\begin{matrix} {{W_{2}^{k} = \begin{bmatrix} e_{k} & 0 \\ 0 & e_{k} \end{bmatrix}},{k = 1},\ldots \mspace{14mu},16,{{{where}\mspace{14mu} e_{k}} = \begin{bmatrix} 0_{{r{({k - 1})}} \times r} \\ I_{r \times r} \\ 0_{{r{({L - k})}} \times r} \end{bmatrix}},} & (98) \end{matrix}$

4Tx Codebook Enhancements for LTE

In the following section, possible 4Tx codebook enhancement alternatives for LTE Release 12 are disclosed. In these examples, {tilde over (e)}_(i) is a 4×1 vector with all zero entries except for the i-th element which has value 1.

Rank-1/2

For a rank-1/2 codebook, the following two alternatives are possible.

Alt-1

Reusing the 8Tx GoB design with N=32 over-sampled beams and 4 adjacent beams per grid, the following 4Tx codebook can be considered.

$\begin{matrix} {\mspace{79mu} {{B = {{\left\lfloor \begin{matrix} b_{0} & b_{1} & \ldots & {b_{31},} \end{matrix} \right\rfloor \lbrack B\rbrack}_{{1 + m},{1 + n}} = ^{j\; \frac{2\pi \; {mn}}{32}}}},\mspace{79mu} {m = 0},{{\ldots \mspace{14mu} \frac{N,}{2}} - 1},{n = 0},1,\cdots,31}} & (99) \\ {X^{(k)} \in \begin{Bmatrix} \left\lfloor \begin{matrix} b_{2\; {kmod}\; 32} & b_{{({{2\; k} + 1})}{mod}\; 32} & b_{{({{2\; k} + 2})}{mod}\; 32} & {\left. b_{{({{2\; k} + 3})}{mod}\; 32} \right\rfloor \text{:}} \end{matrix} \right. \\ {{k = 0},1,{\ldots \mspace{14mu} 15}} \end{Bmatrix}} & (100) \\ {\mspace{79mu} {W_{1}^{(k)} = \begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}}} & (101) \\ {\mspace{79mu} {{{Codebook}\; 1\text{:}C_{1}} = \left\{ {W_{1}^{(0)},W_{1}^{(1)},W_{1}^{(2)},\ldots \mspace{14mu},W_{1}^{(15)}} \right\}}} & (102) \end{matrix}$

Rank-1: (4-bit)

$\begin{matrix} {{W_{2} \in C_{2}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y \\ Y \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y \\ {j\; Y} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y \\ {- Y} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y \\ {{- j}\; Y} \end{bmatrix}}} \right\}} & (103) \\ {\mspace{79mu} {Y \in \left\{ {{\overset{\sim}{e}}_{1},{\overset{\sim}{e}}_{2},{\overset{\sim}{e}}_{3},{\overset{\sim}{e}}_{4}} \right\}}} & (104) \end{matrix}$

Rank-2: (4-bit)

$\begin{matrix} {\mspace{79mu} {{W_{2} \in C_{2}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}}} \right\}}} & (105) \\ {\left( {Y_{1},Y_{2}} \right) \in \left\{ {\left( {{\overset{\sim}{e}}_{1},{\overset{\sim}{e}}_{1}} \right),\left( {{\overset{\sim}{e}}_{2},{\overset{\sim}{e}}_{2}} \right),\left( {{\overset{\sim}{e}}_{3},{\overset{\sim}{e}}_{3}} \right),\left( {{\overset{\sim}{e}}_{4},{\overset{\sim}{e}}_{4}} \right),\left( {{\overset{\sim}{e}}_{1},{\overset{\sim}{e}}_{2}} \right),\left( {{\overset{\sim}{e}}_{2},{\overset{\sim}{e}}_{3}} \right),\left( {{\overset{\sim}{e}}_{1},{\overset{\sim}{e}}_{4}} \right),\left( {{\overset{\sim}{e}}_{2},{\overset{\sim}{e}}_{4}} \right)} \right\}} & (106) \end{matrix}$

Rank-2 (3-bit)

For rank-2, if a (3-bit) W₂ is preferred, (Y1, Y2) can be changed to:

(Y ₁ ,Y ₂)ε{({tilde over (e)} ₁ ,{tilde over (e)} ₁),({tilde over (e)} ₂ ,{tilde over (e)} ₂),({tilde over (e)} ₃ ,{tilde over (e)} ₃),({tilde over (e)} ₄ ,{tilde over (e)} ₄)}.

Each W1 matrix is constructed by a set of adjacent DFT beams and covers a narrow range of angle-of-departures/arrivals. The fundamental consideration is based the feedback of wideband/long-term channel based on W₁ matrix, and the fed back W1 matrix in a properly designed C1 codebook should be able to reflect the wideband AoA/AoDs with sufficient accuracy. For instance, most macro base stations in cellular communication systems are elevated on a cell tower and likely have a direct line-of-sign to the UE, where the angle of incoming radio signals to a UE is within in a small range. Hence, the wideband W1 comprising a set of adjacent beams can be used to cover the range of incoming radio signals on the wideband, whereas the narrowband W2 codebook can be used to select a specific beam on each subband. This W₁ design is particular suitable to macro base station with narrowly spaced antennas, propagation channel with sufficient line-of-sights, and perfectly calibrated base station antennas.

Alt-2

A rank-1/2 codebook comprises two components, where W₁ structures are different in each component. For the first 8 W₁ matrices, Xn comprise four adjacent DFT beams with over-sampling rate of N=16. For the last 8 W₁ matrices, Xn comprise four distributed non-adjacent DFT beams uniformly sampling the [0, 360] angle of arrival sub-space. This provides wider angular spread coverage and may be beneficial to large timing misalignment error.

The W₁ codebook therefore can be given by:

$\begin{matrix} {\mspace{79mu} {{i_{1} = 0},1,\ldots \mspace{14mu},{7\text{:}}}} & \; \\ {X^{(i_{1})} \in \begin{matrix} \left\{ \left\lfloor b_{2i_{1}{mod}\; 16} \right. \right. & b_{{({{2i_{1}} + 1})}{mod}\; 16} & b_{{({{2i_{1}} + 2})}{mod}\; 16} & {\left. \left. b_{{({{2i_{1}} + 3})}{mod}\; 16} \right\rfloor \right\},} \end{matrix}} & (108) \\ {\mspace{79mu} {{{b_{n}\left( {m + 1} \right)} = ^{j\frac{2\pi \; {mn}}{32}}},{n = 0},1,\ldots \mspace{14mu},15,{m = 0},{\ldots \mspace{14mu} 1}}} & (109) \\ {\mspace{79mu} {{i_{1} = 8},9,\ldots \mspace{14mu},{15\text{:}}}} & \; \\ {X^{(i_{1})} \in \left\{ \left\lfloor \begin{matrix} b_{{({i_{1} - 8})}{mod}\; 32} & b_{{({i_{1} - 8})} + {8{mod}\; 32}} & b_{{({i_{1} - 8})} + {16{mod}\; 32}} & {\left. \left. b_{{({i_{1} - 8})} + {24{mod}\; 32}} \right\rfloor \right\},} \end{matrix} \right. \right.} & (110) \\ {\mspace{79mu} {{{b_{n}\left( {m + 1} \right)} = ^{j\frac{2\pi \; {mn}}{32}}},{n = 0},1,\ldots \mspace{14mu},31,{m = 0},{\ldots \mspace{14mu} 1}}} & (111) \end{matrix}$

As can be seen, for the last eight W₁ matrices, each W₁ matrix in codebook C₁ is comprised of four non-adjacent DFF beams. The four DFT beams in each W₁ matrix are widely spaced and uniformly distributed in the [0,360] DFT subspace to cover a wide range of angle-of-arrivals/departures. The DFT beams in a first W1 matrix are rotated by a small angle against four DFT beams in a second W_(i) matrix. More specifically, the W1 matrices comprising widely spaced DFT beams are summarized as

X ₁ ⁽⁸⁾ ε{[b ₀ b ₈ b ₁₆ b ₂₄]}

X ₁ ⁽⁹⁾ ε{[b ₁ b ₉ b ₁₇ b ₂₅]}

X ₁ ⁽¹⁵⁾ ε{[b ₇ b ₁₅ b ₂₃ b ₃₁]}  (112)

Such a design framework is particularly beneficial in uses cases (e.g., widely spaced antenna components, un-calibrated antenna array, rich multipath scattering environment) where the angle-of-arrival/departures of the incoming wireless signals are distributed in a wide range. For instance, in a heterogeneous deployment scenario where dense small cells are overlaid on top of macro base station on the same frequency, the multipath radio signals received by a UE are reflected by numerous scattering objects surrounding the UE (e.g., building, cars). Have widely spaced and non-adjacent DFT beams in W1 ensures that all incoming signals from different angles can be properly captured. As another use case, it is noted that the transmitter timing at different antennas on a base station shall be synchronized by careful timing alignment calibration. In practice, perfect timing alignment cannot always be guaranteed at a base station, especially for low-cost low-power small base stations (e.g. pico-cells, femto-cells) with cheaper RF components. In 3GPP LTE, a maximum 65 nano-second downlink transmission timing misalignment requirement is set forth for all base stations. A consequence of misaligned antenna timing in the time domain is the increased channel variation on different OFDM subcarriers in the frequency domain, and the main DFF beam angle on one frequency subband can be significantly different than the main DFT beam angle on another subband. In this case, having non-adjacent widely spaced DFT beams in the W₁ matrix ensures that the wideband angle-of-arrival/departures can be more reliably covered, resulting in higher feedback accuracy.

The W₂ codebook for rank-1 (4-bit) may be given by:

$\begin{matrix} {{{W_{2} \in C_{2}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y \\ Y \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y \\ {j\; Y} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y \\ {- Y} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y \\ {{- j}\; Y} \end{bmatrix}}} \right\}},} & (113) \\ {Y \in \left\{ {{\overset{\sim}{e}}_{1},{\overset{\sim}{e}}_{2},{\overset{\sim}{e}}_{3},{\overset{\sim}{e}}_{4}} \right\}} & (114) \end{matrix}$

The W₂ codebook for rank-2 (4-bit) may be given by:

For W₂ corresponding to i₁=0, 1, . . . , 7

$\begin{matrix} {\mspace{79mu} {{{W_{2} \in C_{2}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}}} \right\}},}} & (115) \\ {\left( {Y_{1},Y_{2}} \right) \in \left\{ {\left( {{\overset{\sim}{e}}_{1},{\overset{\sim}{e}}_{1}} \right),\left( {{\overset{\sim}{e}}_{2},{\overset{\sim}{e}}_{2}} \right),\left( {{\overset{\sim}{e}}_{3},{\overset{\sim}{e}}_{3}} \right),\left( {{\overset{\sim}{e}}_{4},{\overset{\sim}{e}}_{4}} \right),\left( {{\overset{\sim}{e}}_{1},{\overset{\sim}{e}}_{2}} \right),\left( {{\overset{\sim}{e}}_{2},{\overset{\sim}{e}}_{3}} \right),\left( {{\overset{\sim}{e}}_{1},{\overset{\sim}{e}}_{4}} \right),\left( {{\overset{\sim}{e}}_{2},{\overset{\sim}{e}}_{4}} \right)} \right\}} & (116) \end{matrix}$

If a (3-bit) W₂ is preferred, (Y1, Y2) may be changed to:

(Y ₁ ,Y ₂)ε{({tilde over (e)} ₁ ,{tilde over (e)} ₁),({tilde over (e)} ₂ ,{tilde over (e)} ₂),{tilde over (e)} ₃ ,{tilde over (e)} ₃),({tilde over (e)} ₄ ,{tilde over (e)} ₄)}.  (117)

For W₂ corresponding to i₁=8, 9, . . . , 15

$\begin{matrix} {{W_{2} \in C_{2}} = \begin{Bmatrix} {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & Y_{2} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {- Y_{1}} & Y_{2} \end{bmatrix}},} \\ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {- Y_{1}} & {- Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {j\; Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}},} \\ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {{- j}\; Y_{1}} & {j\; Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {{- j}\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}},} \end{Bmatrix}} & (118) \\ {\mspace{79mu} {\left( {Y_{1},Y_{2}} \right) \in \left\{ {\left( {{\overset{\sim}{e}}_{1},{\overset{\sim}{e}}_{3}} \right),\left( {{\overset{\sim}{e}}_{2},{\overset{\sim}{e}}_{4}} \right)} \right\}}} & (119) \end{matrix}$

If a (3-bit) W₂ is preferred, the W₂ codebook may be changed to

$\begin{matrix} {\mspace{79mu} {{{W_{2} \in C_{2}} = \begin{Bmatrix} {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & Y_{2} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},} \\ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {- Y_{1}} & Y_{2} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {- Y_{1}} & {- Y_{2}} \end{bmatrix}}} \end{Bmatrix}},}} & (120) \\ {\mspace{79mu} {{\left( {Y_{1},Y_{2}} \right) \in \left\{ {\left( {{\overset{\sim}{e}}_{1},{\overset{\sim}{e}}_{3}} \right),\left( {{\overset{\sim}{e}}_{2},{\overset{\sim}{e}}_{4}} \right)} \right\}},}} & (121) \\ {\mspace{79mu} {or}} & \; \\ {{W_{2} \in C_{2}} = \begin{Bmatrix} {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & Y_{2} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {- Y_{1}} & Y_{2} \end{bmatrix}},} \\ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {- Y_{1}} & {- Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {j\; Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}},} \\ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {{- j}\; Y_{1}} & {j\; Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {{- j}\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}},} \end{Bmatrix}} & (122) \\ {\mspace{79mu} {\left( {Y_{1},Y_{2}} \right) \in {\left\{ \left( {{\overset{\sim}{e}}_{1},{\overset{\sim}{e}}_{3}} \right) \right\} \mspace{14mu} {or}\mspace{14mu} \left\{ \left( {{\overset{\sim}{e}}_{2},{\overset{\sim}{e}}_{4}} \right) \right\}}}} & (123) \end{matrix}$

In one embodiment, the new rank-1/2 codebook designs set forth above may be incorporated into an LTE system complying with LTE Release 12. A subset of precoders in the proposed codebooks above may be used to construct a new Release 12 4Tx codebook, for either rank-1 or rank-2. For example, the W1 codebook may be constructed by W₁ matrices only comprising widely spaced DFT beams, e.g., i₂=8, 9, . . . 15 in Equation (110)-(111).

FIG. 6 illustrates the precoding matrix/vector selection process according to one embodiment. The final precoding matrix/vector is a function of two PMIs:

W=ƒ(PMI ₁ ,PMI ₂)  (124)

where PMI₁ is updated at a significantly less frequent rate than PMI₂. PMI₁ is intended for the entire system bandwidth while PMI₂ can be frequency-selective.

FIG. 6 illustrates the technique used in downlink LTE-Advanced (LTE-A). The UE selects PMI₁ and PMI₂ and hence W₁ and W₂ in a manner similar to the LTE feedback paradigm.

The UE first selects the first precoder codebook W₁ in block 601 based on the long-term channel properties such as spatial covariance matrix such as in a spatial correlation domain from an input of PMI₁. This is done in a long-term basis consistent with the fact that spatial covariance matrix needs to be estimated over a long period of time and in a wideband manner.

Conditioned upon W1, the UE selects W₂ based on the short-term (instantaneous) channel. This is a two stage process. In block 602, a set of codebooks CB₂ ⁽⁰⁾ to CB₂ ^((N−1)) is selected based upon the PMI₁ input. Block 603 selects one precoder corresponding to the selected codebook CB₂ ^((PMI) ₁ ⁾ and PMI₂. This selection may be conditioned upon the selected rank indicator (RI). Alternatively, RI can be selected jointly with W₂. Block 604 takes the selected W₁ and W₂ and forms the function ƒ(W₁, W₂).

PMI₁ and PMI₂ are reported to the base station (eNodeB) at different rates and/or different frequency resolutions.

Based on this design framework, several types of codebook design are described herein. While each type can stand alone, it is also possible to use different types in a single codebook design especially if the design is intended for different scenarios. A simple yet versatile design can be devised as follows:

PMI₁ selects one of the N codebooks W₁ as indicated above.

PMI₂ selects at least one of the column vectors of W, wherein the number of selected column vectors is essentially the recommended transmission rank (RI).

This design allows construction of N different scenarios where the codebook W₁ for each scenario is chosen to contain a set of basis vectors for a particular spatial channel characteristic W₂. While any two-dimensional function can be used in equation (124), this disclosure assumes a product (matrix multiplication) function f(x,y)=xy. Thus the final short-term precoding matrix/vector is computed as a matrix product of W₁ and W₂: W=W₁W₂.

FIG. 7 is a block diagram illustrating internal details of a mobile UE 701 and an eNodeB 702 in the network system of FIG. 1. Mobile UE 701 may represent any of a variety of devices such as a server, a desktop computer, a laptop computer, a cellular phone, a Personal Digital Assistant (PDA), a smart phone or other electronic devices. In some embodiments, the electronic mobile UE 701 communicates with eNodeB 702 based on a LTE or Evolved Universal Terrestrial Radio Access Network (E-UTRAN) protocol. Alternatively, another communication protocol now known or later developed can be used.

Mobile UE 701 comprises a processor 703 coupled to a memory 704 and a transceiver 705. The memory 704 stores (software) applications 706 for execution by the processor 703. The applications could comprise any known or future application useful for individuals or organizations. These applications could be categorized as operating systems (OS), device drivers, databases, multimedia tools, presentation tools, Internet browsers, emailers, Voice-Over-Internet Protocol (VOIP) tools, file browsers, firewalls, instant messaging, finance tools, games, word processors or other categories. Regardless of the exact nature of the applications, at least some of the applications may direct the mobile UE 701 to transmit UL signals to eNodeB (base-station) 702 periodically or continuously via the transceiver 705. In at least some embodiments, the mobile UE 701 identifies a Quality of Service (QoS) requirement when requesting an uplink resource from eNodeB 702. In some cases, the QoS requirement may be implicitly derived by eNodeB 702 from the type of traffic supported by the mobile UE 701. As an example, VOIP and gaming applications often involve low-latency uplink (UL) transmissions while High Throughput (HTP)/Hypertext Transmission Protocol (HTTP) traffic can involve high-latency uplink transmissions.

Transceiver 705 includes uplink logic which may be implemented by execution of instructions that control the operation of the transceiver. Some of these instructions may be stored in memory 704 and executed when needed by processor 703. As would be understood by one of skill in the art, the components of the uplink logic may involve the physical (PHY) layer and/or the Media Access Control (MAC) layer of the transceiver 705. Transceiver 705 includes one or more receivers 707 and one or more transmitters 708.

Processor 703 may send or receive data to various input/output devices 709. A subscriber identity module (SIM) card stores and retrieves information used for making calls via the cellular system. A Bluetooth baseband unit may be provided for wireless connection to a microphone and headset for sending and receiving voice data. Processor 703 may send information to a display unit for interaction with a user of mobile UE 701 during a call process. The display may also display pictures received from the network, from a local camera, or from other sources such as a Universal Serial Bus (USB) connector. Processor 703 may also send a video stream to the display that is received from various sources such as the cellular network via RF transceiver 705 or the camera.

During transmission and reception of voice data or other application data, transmitter 707 may be or become non-synchronized with its serving eNodeB. In this case, it sends a random access signal. As part of this procedure, it determines a preferred size for the next data transmission, referred to as a message, by using a power threshold value provided by the serving eNodeB, as described in more detail above. In this embodiment, the message preferred size determination is embodied by executing instructions stored in memory 704 by processor 703. In other embodiments, the message size determination may be embodied by a separate processor/memory unit, by a hardwired state machine, or by other types of control logic, for example.

eNodeB 702 comprises a processor 710 coupled to a memory 711, symbol processing circuitry 712, and a transceiver 713 via backplane bus 714. The memory stores applications 715 for execution by processor 710. The applications could comprise any known or future application useful for managing wireless communications. At least some of the applications 715 may direct eNodeB 702 to manage transmissions to or from mobile UE 701.

Transceiver 713 comprises an uplink Resource Manager, which enables eNodeB 702 to selectively allocate uplink Physical Uplink Shared CHannel (PUSCH) resources to mobile UBE 701. As would be understood by one of skill in the art, the components of the uplink resource manager may involve the physical (PHY) layer and/or the Media Access Control (MAC) layer of the transceiver 713. Transceiver 713 includes at least one receiver 715 for receiving transmissions from various UEs within range of eNodeB 702 and at least one transmitter 716 for transmitting data and control information to the various UEs within range of eNodeB 702.

The uplink resource manager executes instructions that control the operation of transceiver 713. Some of these instructions may be located in memory 711 and executed when needed on processor 710. The resource manager controls the transmission resources allocated to each UE 701 served by eNodeB 702 and broadcasts control information via the PDCCH.

Symbol processing circuitry 712 performs demodulation using known techniques. Random access signals are demodulated in symbol processing circuitry 712.

During transmission and reception of voice data or other application data, receiver 715 may receive a random access signal from a UE 701. The random access signal is encoded to request a message size that is preferred by UE 701. UE 701 determines the preferred message size by using a message threshold provided by eNodeB 702. In this embodiment, the message threshold calculation is embodied by executing instructions stored in memory 711 by processor 710. In other embodiments, the threshold calculation may be embodied by a separate processor/memory unit, by a hardwired state machine, or by other types of control logic, for example. Alternatively, in some networks the message threshold is a fixed value that may be stored in memory 711, for example. In response to receiving the message size request, eNodeB 702 schedules an appropriate set of resources and notifies UE 701 with a resource grant.

Many modifications and other embodiments of the invention(s) will come to mind to one skilled in the art to which the invention(s) pertain having the benefit of the teachings presented in the foregoing descriptions, and the associated drawings. Therefore, it is to be understood that the invention(s) are not to be limited to the specific embodiments disclosed. Although specific terms are employed herein, they are used in a generic and descriptive sense only and not for purposes of limitation. 

1-19. (canceled)
 20. A method of channel state information (CSI) feedback in a wireless communication system, comprising: receiving one or more precoding matrix indicator (PMI) signals from a remote transceiver; and generating a precoding matrix W derived from a matrix multiplication of two matrices W₁ and W₂, where said precoding matrix W is applicable to precoding one or more layers of data streams, matrix W₁ selected from a first codebook C₁ based on a first group of bits in the PMI signals, and matrix W₂ selected from a second codebook C₂ based on a second group of bits in the PMI signals, wherein the first codebook C₁ comprises the following W₁ matrices: C ₁ ={W ₁ ⁽⁰⁾ ,W ₁ ⁽¹⁾ ,W ₁ ⁽²⁾ , . . . ,W ₁ ⁽¹⁵⁾} and matrix W₁ ^((k)) for k=0, 1, . . . , 15, can be written in the form ${W_{1}^{(k)} = \begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}},$ where 0 is a matrix with all entries equal to zero and X^((k)) is a matrix having two or more columns where at least one column is equal to b_(k mod N) and at least one column is equal to b_((k+N/2)mod N) where $b_{k} = \begin{bmatrix} 1 \\ ^{{j2\pi}\; {k/N}} \end{bmatrix}$ and N=32.
 21. The method of claim 20, wherein the number of layers of the data stream is one, and wherein the second codebook C₂ comprises at least one matrix of the following set: $\left\{ {{\frac{1}{2}\begin{bmatrix} Y \\ Y \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {j\; Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {- Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {{- j}\; Y} \end{bmatrix}}} \right\},{Y \in \left\{ {{\overset{\sim}{e}}_{1},{\overset{\sim}{e}}_{2},{\overset{\sim}{e}}_{3},{\overset{\sim}{e}}_{4}} \right\}}$ where {tilde over (e)}_(i) is a 4×1 vector with all zero entries except for the i-th element which has value
 1. 22. The method of claim 20, wherein the number of layers of the data stream is one, and wherein the second codebook C₂ comprises at least one matrix of the following set: $\left\{ {{\frac{1}{2}\begin{bmatrix} Y \\ {{\alpha (k)}Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {j\; {\alpha (k)}Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {{- {\alpha (k)}}Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {{- j}\; {\alpha (k)}Y} \end{bmatrix}}} \right\},{{Y \in {\left\{ {{\overset{\sim}{e}}_{1},{\overset{\sim}{e}}_{2},{\overset{\sim}{e}}_{3},{\overset{\sim}{e}}_{4}} \right\} \mspace{31mu} {\alpha (k)}}} = \left( ^{j\; 2\; {\pi/32}} \right)^{2{({k - 1})}}}$ where {tilde over (e)}_(i) is a 4×1 vector with all zero entries except for the i-th element which has value
 1. 23. The method of claim 20, wherein the number of layers of the data stream is one, and wherein the precoding matrix W is chosen as a function of the two PMI values i₁ and i₂ according to i₂ i₁ 0 1 2 3 4 5 6 7 0-15 W⁽¹⁾ _(i) ₁ _(,0) W⁽¹⁾ _(i) ₁ _(,8) W⁽¹⁾ _(i) ₁ _(,16) W⁽¹⁾ _(i) ₁ _(,24) W⁽¹⁾ _(i) ₁ _(+8,2) W⁽¹⁾ _(i) ₁ _(+8,10) W⁽¹⁾ _(i) ₁ _(+8,18) W⁽¹⁾ _(i) ₁ _(+8,26) i₂ i₁ 8 9 10 11 12 13 14 15 0-15 W⁽¹⁾ _(i) ₁ _(+16,4) W⁽¹⁾ _(i) ₁ _(+16,12) W⁽¹⁾ _(i) ₁ _(+16,20) W⁽¹⁾ _(i) ₁ _(+16,28) W⁽¹⁾ _(i) ₁ _(+24,6) W⁽¹⁾ _(i) ₁ _(+24,14) W⁽¹⁾ _(i) ₁ _(+24,22) W⁽¹⁾ _(i) ₁ _(+24,30) where  $W_{m,n}^{(1)} = {\frac{1}{2}\begin{bmatrix} v_{m}^{\prime} \\ {\phi_{n}^{\prime}v_{m}^{\prime}} \end{bmatrix}}$

φ′_(n) =e ^(j2πn/32) v′ _(m)=[1e ^(j2πm/32)]^(T).
 24. The method of claim 20, wherein the number of layers of the data stream is two, and wherein the second codebook C₂ comprises at least one matrix of the following form: ${{W_{2} \in C_{2}} = \left\{ {{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},{\frac{1}{\sqrt{2}}\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}}} \right\}},$ (Y ₁ ,Y ₂)ε{({tilde over (e)} ₁ ,{tilde over (e)} ₁),({tilde over (e)} ₂ ,{tilde over (e)} ₂),({tilde over (e)} ₃ ,{tilde over (e)} ₃),({tilde over (e)} ₄ ,{tilde over (e)} ₄),({tilde over (e)} ₁ ,{tilde over (e)} ₂),({tilde over (e)} ₂ ,{tilde over (e)} ₃),({tilde over (e)} ₁ ,{tilde over (e)} ₄),({tilde over (e)} ₂ ,{tilde over (e)} ₄)} where {tilde over (e)}_(i) is a 4×1 vector with all zero entries except for the i-th element which has value
 1. 25. The method of claim 20, wherein the number of layers of the data stream is two, and wherein the precoding matrix W is chosen as a function of the two PMI values i₁ and i₂ according to i₂ i₁ 0 1 2 3 0-15 W⁽²⁾ _(i) ₁ _(,i) ₁ _(,0) W⁽²⁾ _(i) ₁ _(,i) ₁ _(,1) W⁽²⁾ _(i) ₁ _(+8,i) ₁ _(+8,0) W⁽²⁾ _(i) ₁ _(+8,i) ₁ _(+8,1) i₂ i₁ 4 5 6 7 0-15 W⁽²⁾ _(i) ₁ _(+16,i) ₁ _(+16,0) W⁽²⁾ _(i) ₁ _(+16,i) ₁ _(+16,1) W⁽²⁾ _(i) ₁ _(+24,i) ₁ _(+24,0) W⁽²⁾ _(i) ₁ _(+24,i) ₁ _(+24,1) i₂ i₁ 8 9 10 11 0-15 W⁽²⁾ _(i) ₁ _(,i) ₁ _(+8,0) W⁽²⁾ _(i) ₁ _(,i) ₁ _(+8,1) W⁽²⁾ _(i) ₁ _(+8,i) ₁ _(+16,0) W⁽²⁾ _(i) ₁ _(+8,i) ₁ _(+16,1) i₂ i₁ 12 13 14 15 0-15 W⁽²⁾ _(i) ₁ _(,i) ₁ _(+24,0) W⁽²⁾ _(i) ₁ _(,i) ₁ _(+24,1) W⁽²⁾ _(i) ₁ _(+8,i) ₁ _(+24,0) W⁽²⁾ _(i) ₁ _(+8,i) ₁ _(+24,1) where  $W_{m,m^{\prime},n}^{(2)} = {\frac{1}{\sqrt{8}}\begin{bmatrix} v_{m}^{\prime} & v_{m^{\prime}}^{\prime} \\ {\phi_{n}v_{m}^{\prime}} & {{- \phi_{n}}v_{m^{\prime}}^{\prime}} \end{bmatrix}}$

φ_(n) =e ^(jπn)/2 v′ _(m)=[1e ^(j2πm/32)]^(T).
 26. A method of channel state information (CSI) feedback in a wireless communication system, comprising: receiving one or more precoding matrix indicator (PMI) signals from a remote transceiver, and generating a precoding matrix W derived from a matrix multiplication of two matrices W₁ and W₂, where said precoding matrix W is applicable to precoding one or more layers of data streams, matrix W₁ selected from a first codebook C₁ based on a first group of bits in the PMI signals, and matrix W₂ selected from a second codebook C₂ based on a second group of bits in the PMI signals, wherein the first codebook C₁ comprises the following W₁ matrices: C ₁ ={W ₁ ⁽⁰⁾ ,W ₁ ⁽¹⁾ ,W ₁ ⁽²⁾ , . . . ,W _(i) ⁽¹⁵⁾} and matrix W₁ ^((k)) for k=0, 1, . . . , 15, can be written in the form ${W_{1}^{(k)} = \begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}},$ where 0 is a matrix with all entries equal to zero, wherein the set of matrices $\left\{ {{{\begin{bmatrix} X^{({\lbrack i_{1}\rbrack})} & 0 \\ 0 & X^{({\lbrack i_{1}\rbrack})} \end{bmatrix}:\; i_{1}} = 8},9,\ldots \mspace{14mu},15} \right\}$ are in C₁ where X ^(([i) ¹ ^(])) ε{[b _(i) ₁ _(−8)mod N) b _(((i) ₁ _(−8)+8)mod N) b _(((l) ₁ _(−8)+16)mod N) b _(((i) ₁ _(−8)+24)mod N)]} b _(k)=[_(e) _(j2πk/N) ¹], and N=32.
 27. The method of claim 26, wherein the number of layers of the data stream is one, and wherein the second codebook C₂ comprises at least one matrix of the following set: $\left\{ {{\frac{1}{2}\begin{bmatrix} Y \\ Y \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {j\; Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {- Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {{- j}\; Y} \end{bmatrix}}} \right\},$ Yε{{tilde over (e)} ₁ ,{tilde over (e)} ₂ ,{tilde over (e)} ₃ ,{tilde over (e)} ₄} where {tilde over (e)}_(i) is a 4×1 vector with all zero entries except for the i-th element which has value
 1. 28. The method of claim 26, wherein the number of layers of the data stream is one, and wherein the second codebook C₂ comprises at least one matrix of the following set: $\left\{ {{\frac{1}{2}\begin{bmatrix} Y \\ {{\alpha (k)}Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {j\; {\alpha (k)}Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {{- {\alpha (k)}}Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {{- j}\; {\alpha (k)}Y} \end{bmatrix}}} \right\},$ Yε{{tilde over (e)} ₁ ,{tilde over (e)} ₂ ,{tilde over (e)} ₃ ,{tilde over (e)} ₄} α(k)=(e ^(j2π/32))^(2(k−1)) where {tilde over (e)}_(i) is a 4×1 vector with all zero entries except for the i-th element which has value
 1. 29. The method of claim 26, wherein the number of layers of the data stream is one, and wherein the precoding matrix W is chosen as a function of the two PMI values i₁ and i₂ according to i₂ i₁ 0 1 2 3 4 5 6 7 0-15 W_(i) ₁ _(,0) ⁽¹⁾ W_(i) ₁ _(,8) ⁽¹⁾ W_(i) ₁ _(,16) ⁽¹⁾ W_(i) ₁ _(,24) ⁽¹⁾ W_(i) ₁ _(+8,2) ⁽¹⁾ W_(i) ₁ _(+8,10) ⁽¹⁾ W_(i) ₁ _(+8,18) ⁽¹⁾ W_(i) ₁ _(+8,26) ⁽¹⁾ i₂ i₁ 8 9 10 11 12 13 14 15 0-15 W_(i) ₁ _(+16,4) ⁽¹⁾ W_(i) ₁ _(+16,12) ⁽¹⁾ W_(i) ₁ _(+16,20) ⁽¹⁾ W_(i) ₁ _(+16,28) ⁽¹⁾ W_(i) ₁ _(+24,6)(1) W_(i) ₁ _(+24,14) ⁽¹⁾ W_(i) ₁ _(+24,22) ⁽¹⁾ W_(i) ₁ _(+24,30) ⁽¹⁾ ${{where}\mspace{14mu} W_{m,n}^{(1)}} = {\frac{1}{2}\begin{bmatrix} v_{m}^{\prime} \\ {\phi_{n}^{\prime}v_{m}^{\prime}} \end{bmatrix}}$

φ′_(n) =e ^(jnπn/32) v′ _(m)=[1e ^(j2πm/32)]^(T).
 30. The method of claim 26, wherein the number of layers of the data stream is two, and wherein the second codebook C₂ comprises at least one matrix of the following form: ${{W_{2} \in C_{2}} = \left\{ {{\frac{1}{2}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}}} \right\}},$ (Y ₁ ,Y ₂)ε{({tilde over (e)} ₁ ,{tilde over (e)} ₁),({tilde over (e)} ₂ ,{tilde over (e)} ₂),({tilde over (e)} ₃ ,{tilde over (e)} ₃),({tilde over (e)} ₄ ,{tilde over (e)} ₄),({tilde over (e)} ₁ ,{tilde over (e)} ₂),({tilde over (e)} ₂ ,{tilde over (e)} ₃),({tilde over (e)} ₁ ,{tilde over (e)} ₄),({tilde over (e)} ₂ ,{tilde over (e)} ₄)} where {tilde over (e)}₁ is a 4×1 vector with all zero entries except for the i-th element which has value
 1. 31. The method of claim 26, wherein the number of layers of the data stream is two, and wherein the precoding matrix W is chosen as a function of the two PMI values i₁ and i₂ according to i₂ i₁ 0 1 2 3 0-15 W_(i) ₁ ,_(i) ₁ _(,0)(2) W_(i) ₁ _(,i) ₁ _(,1) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+8,0) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+8,1) ⁽²⁾ i₂ i₁ 4 5 6 7 0-15 W_(i) ₁ _(+16,i) ₁ _(+16,0) ⁽²⁾ W_(i) ₁ _(+16,i) ₁ _(+16,1) ⁽²⁾ W_(i) ₁ _(+24,i) ₁ _(+24,0) ⁽²⁾ W_(i) ₁ _(+24,i) ₁ _(+24,1) ⁽²⁾ i₂ i₁ 8 9 10 11 0-15 W_(i) ₁ _(,i) ₁ _(+8,0) ⁽²⁾ W_(i) ₁ _(,i) ₁ _(+8,1) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+16,0) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+16,1) ⁽²⁾ i₂ i₁ 12 13 14 15 0-15 W_(i) ₁ _(,i) ₁ _(+24,0) ⁽²⁾ W_(i) _(1,) _(i) ₁ _(+24,1) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+24,0) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+24,1) ⁽²⁾ ${{where}\mspace{14mu} W_{m,m^{\prime},n}^{(2)}} = {\frac{1}{\sqrt{8}}\begin{bmatrix} v_{m}^{\prime} & v_{m^{\prime}}^{\prime} \\ {\phi_{n}v_{m}^{\prime}} & {{- \phi_{n}}v_{m^{\prime}}^{\prime}} \end{bmatrix}}$

φ_(n) =e ^(jπn/2) v′ _(m)=[1e ^(j2πn/32)]^(T).
 32. A method of channel state information (CSI) feedback in a wireless communication system, node comprising: receiving one or more precoding matrix indicator (PMI) signals from a remote transceiver, and generating a precoding matrix W derived from a matrix multiplication of two matrices W₁ and W₂, where said precoding matrix W is applicable to precoding one or more layers of data streams, matrix W₁ is selected from a first codebook C₁ based on a first group of bits in the PMI signals, and matrix W₂ is selected from a second codebook C₂ based on a second group of bits in the PMI signals, wherein the first codebook C₁ comprises the following W₁ matrices constructed by non-adjacent Discrete Fourier Transform (DFT) vectors: B=[b ₀ b ₁ . . . b ₃₁] b _(k)=[1e ^(j2πk/32)]^(T), for k=0,1, . . . ,31 X ^((k)) =[b _(k) b _((k+8)mod 32) b _((k+16)mod 32) b _((k+24)mod 32)], for k=0,1, . . . ,15 W ₁ ^((k))=[₀ ^(ds (k)) _(X) _((k)) ⁰] for k=0,1, . . . ,15 C ₁ ={W ₁ ⁽⁰⁾ ,W ₁ ⁽¹⁾ , . . . ,W ₁ ⁽¹⁵⁾} for k=0,1, . . . ,15.
 33. The method of claim 32, wherein the number of layers of the data stream is one, and wherein the second codebook C₂ comprises at least one matrix of the following set: $\left\{ {{\frac{1}{2}\begin{bmatrix} Y \\ Y \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {j\; Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {- Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {{- j}\; Y} \end{bmatrix}}} \right\},$ Yε{{tilde over (e)} ₁ ,{tilde over (e)} ₂ ,{tilde over (e)} ₃ ,{tilde over (e)} ₄} where {tilde over (e)}_(i) is a 4×1 vector with all zero entries except for the i-th element which has value
 1. 34. The method of claim 32, wherein the number of layers of the data stream is one, and wherein the second codebook C₂ comprises at least one matrix of the following set: $\left\{ {{\frac{1}{2}\begin{bmatrix} Y \\ {{\alpha (k)}Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {{{j\alpha}(k)}\; Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {{- {\alpha (k)}}Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {{- j}\; {\alpha (k)}Y} \end{bmatrix}}} \right\},$ Yε{{tilde over (e)} ₁ ,{tilde over (e)} ₂ ,{tilde over (e)} ₃ ,{tilde over (e)} ₄} α(k)=(e ^(j2π/32))^(k(k−1)) where {tilde over (e)}₁ is a 4×1 vector with all zero entries except for the i-th element which has value
 1. 35. The method of claim 32, wherein the number of layers of the data stream is one, and wherein the precoding matrix W is chosen as a function of the two PMI values i₁ and i₂ according to i₂ i₁ 0 1 2 3 4 5 6 7 0-15 W_(i) ₁ _(,0) ⁽¹⁾ W_(i) ₁ ,₈ ⁽¹⁾ W_(i) ₁ _(,16) ⁽¹⁾ W_(i) ₁ _(,24) ⁽¹⁾ W_(i) ₁ _(+8,2) ⁽¹⁾ W_(i) ₁ _(+8,10) ⁽¹⁾ W_(i) ₁ _(+8,18) ⁽¹⁾ W_(i) ₁ _(+8,26) ⁽¹⁾ i₂ i₁ 8 9 10 11 12 13 14 15 0-15 W_(i) ₁ _(+16,4) ⁽¹⁾ W_(i) ₁ _(+16,12) ⁽¹⁾ W_(i) ₁ _(+16,20) ⁽¹⁾ W_(i) ₁ _(+16,28) ⁽¹⁾ W_(i) ₁ _(+24,6) ⁽¹⁾ W_(i) ₁ _(+24,14) ⁽¹⁾ W_(i) ₁ _(+24,22) ⁽¹⁾ W_(i) ₁ _(+24,30) ⁽¹⁾ ${{where}\mspace{14mu} W_{m,n}^{(1)}} = {\frac{1}{2}\begin{bmatrix} v_{m}^{\prime} \\ {\phi_{n}^{\prime}v_{m}^{\prime}} \end{bmatrix}}$

φ′_(n) =e ^(j2πn/32) v′ _(m)=[1e ^(j2πm/32)]^(T).
 36. The method of claim 32, wherein the number of layers of the data stream is two, and wherein the second codebook C₂ comprises at least one matrix of the following form: ${{W_{2} \in C_{2}} = \left\{ {{\frac{1}{2}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}}} \right\}},$ (Y ₁ ,Y ₂)ε{({tilde over (e)} ₁ ,{tilde over (e)} ₁),({tilde over (e)} ₂ ,{tilde over (e)} ₂),({tilde over (e)} ₃ ,{tilde over (e)} ₃),({tilde over (e)} ₄ ,{tilde over (e)} ₄),({tilde over (e)} ₁ ,{tilde over (e)} ₂),({tilde over (e)} ₂ ,{tilde over (e)} ₃),({tilde over (e)} ₁ ,{tilde over (e)} ₄),({tilde over (e)} ₂ ,{tilde over (e)} ₄)} where {tilde over (e)}₁ is a 4×1 vector with all zero entries except for the i-th element which has value
 1. 37. The method of claim 32, wherein the number of layers of the data stream is two, and wherein the precoding matrix W is chosen as a function of the two PMI values i₁ and i₂ according to i₂ i₁ 0 1 2 3 0-15 W_(i) ₁ ,_(i) ₁ _(,0) ⁽²⁾ W_(i) ₁ _(,i) ₁ _(,1) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+8,0) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+8,1) ⁽²⁾ i₂ i₁ 4 5 6 7 0-15 W_(i) ₁ _(+16,i) ₁ _(+16,0) ⁽²⁾ W_(i) ₁ _(+16,i) ₁ _(+16,1) ⁽²⁾ W_(i) ₁ _(+24,i) ₁ _(+24,0) ⁽²⁾ W_(i) ₁ _(+24,i) ₁ _(+24,1) ⁽²⁾ i₂ i₁ 8 9 10 11 0-15 W_(i) ₁ ,_(i) ₁ _(+8,0) ⁽²⁾ W_(i) ₁ _(,i) ₁ _(+8,1) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+16,0) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+16,1) ⁽²⁾ i₂ i₁ 12 13 14 15 0-15 W_(i) ₁ ,_(i) ₁ _(+24,0) ⁽²⁾ W_(i) ₁ _(,i) ₁ _(+24,1) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+24,0) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+24,1) ⁽²⁾ ${{where}\mspace{14mu} W_{m,m^{\prime},n}^{(2)}} = {\frac{1}{\sqrt{8}}\begin{bmatrix} v_{m}^{\prime} & v_{m^{\prime}}^{\prime} \\ {\phi_{n}v_{m}^{\prime}} & {{- \phi_{n}}v_{m^{\prime}}^{\prime}} \end{bmatrix}}$

φ_(n) =e ^(jπn/2) v′ _(m)=[1e ^(j2πm/32)]^(T).
 38. A method of channel state information (CSI) feedback in a wireless communication system, node comprising: receiving one or more precoding matrix indicator (PMI) signals from a remote transceiver, and generating a precoding matrix W derived from a matrix multiplication of two matrices W₁ and W₂, where said precoding matrix W is applicable to precoding one or more layers of data streams, matrix W₁ is selected from a first codebook C₁ based on a first group of bits in the PMI signals, and matrix W₂ is selected from a second codebook C₂ based on a second group of bits in the PMI signals, wherein the first codebook C₁ is constructed as C ₁ ={W ₁ ⁽⁰⁾ ,W ₁ ⁽¹⁾ , . . . ,W ₁ ⁽¹⁵⁾} for k=0,1, . . . ,15. where $W_{1}^{(k)} = \begin{bmatrix} X^{(k)} & 0 \\ 0 & X^{(k)} \end{bmatrix}$ for k=0, 1, . . . , 15 using X ^((k)) =[b _(k) b _((k+8)mod 32) b _((k+16)mod 32) b _((k+24)mod 32)], b _(k)=[1e ^(j2πk/32)]^(T), for k=0,1, . . . ,31
 39. The method of claim 38, wherein the number of layers of the data stream is one, and wherein the second codebook C₂ comprises at least one matrix of the following set: $\left\{ {{\frac{1}{2}\begin{bmatrix} Y \\ Y \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {j\; Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {- Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {{- j}\; Y} \end{bmatrix}}} \right\},$ for at least one vector Y ε{{tilde over (e)} ₁ ,{tilde over (e)} ₂ ,{tilde over (e)} ₃ ,{tilde over (e)} ₄} where {tilde over (e)}_(i) is a 4×1 vector with all zero entries except for the i-th element which has value
 1. 40. The method of claim 38, wherein the number of layers of the data stream is one, and wherein the second codebook C₂ comprises at least one matrix of the following set: $\left\{ {{\frac{1}{2}\begin{bmatrix} Y \\ {{\alpha (k)}Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {{{j\alpha}(k)}\; Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {{- {\alpha (k)}}Y} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y \\ {{- j}\; {\alpha (k)}Y} \end{bmatrix}}} \right\},$ for at least one vector Y ε{{tilde over (e)} ₁ ,{tilde over (e)} ₂ ,{tilde over (e)} ₃ ,{tilde over (e)} ₄} and at least one value k where α(k)=(e ^(j2π/32))^(2(k−1)) and {tilde over (e)}_(i) is a 4×1 vector with all zero entries except for the i-th element which has value
 1. 41. The method of claim 38, wherein the number of layers of the data stream is one, and wherein the precoding matrix W is chosen as a function of the two PMI values i₁ and i₂ according to i₂ i₁ 0 1 2 3 4 5 6 7 0-15 W_(i) ₁ _(,0) ⁽¹⁾ W_(i) ₁ _(,8) ⁽¹⁾ W_(i) ₁ _(,16) ⁽¹⁾ W_(i) ₁ _(,24) ⁽¹⁾ W_(i) ₁ _(+8,2) ⁽¹⁾ W_(i) ₁ _(+8,10) ⁽¹⁾ W_(i) ₁ _(+8,18) ⁽¹⁾ W_(i) ₁ _(+8,26) ⁽¹⁾ i₂ i₁ 8 9 10 11 12 13 14 15 0-15 W_(i) ₁ _(+16,4) ⁽¹⁾ W_(i) ₁ _(+16,12) ⁽¹⁾ W_(i) ₁ _(+16,20) ⁽¹⁾ W_(i) ₁ _(+16,28) ⁽¹⁾ W_(i) ₁ _(+24,6) ⁽¹⁾ W_(i) ₁ _(+24,14) ⁽¹⁾ W_(i) ₁ _(+24,22) ⁽¹⁾ W_(i) ₁ _(+24,30) ⁽¹⁾ ${{where}\mspace{14mu} W_{m,n}^{(1)}} = {\frac{1}{2}\begin{bmatrix} v_{m}^{\prime} \\ {\phi_{n}^{\prime}v_{m}^{\prime}} \end{bmatrix}}$

φ′_(n) =e ^(j2πn/32) v′ _(m)=[1e ^(j2πm/32)]^(T) where W=W_(m,n) ⁽¹⁾.
 42. The method of claim 38, wherein the number of layers of the data stream is two, and wherein the second codebook C₂ comprises at least one matrix of the following form: ${{W_{2} \in C_{2}} = \left\{ {{\frac{1}{2}\begin{bmatrix} Y_{1} & Y_{2} \\ Y_{1} & {- Y_{2}} \end{bmatrix}},{\frac{1}{2}\begin{bmatrix} Y_{1} & Y_{2} \\ {j\; Y_{1}} & {{- j}\; Y_{2}} \end{bmatrix}}} \right\}},$ for at least one pair of vectors satisfying (Y ₁ ,Y ₂)ε{({tilde over (e)} ₁ ,{tilde over (e)} ₁),({tilde over (e)} ₂ ,{tilde over (e)} ₂),({tilde over (e)} ₃ ,{tilde over (e)} ₃),({tilde over (e)} ₄ ,{tilde over (e)} ₄),({tilde over (e)} ₁ ,{tilde over (e)} ₂),({tilde over (e)} ₂ ,{tilde over (e)} ₃),({tilde over (e)} ₁ ,{tilde over (e)} ₄),({tilde over (e)} ₂ ,{tilde over (e)} ₄)} where {tilde over (e)}_(i) is a 4×1 vector with all zero entries except for the i-th element which has value
 1. 43. The method of claim 38, wherein the number of layers of the data stream is two, and wherein the precoding matrix W is chosen as a function of the two PMI values i₁ and i₂ according to i₂ i₁ 0 1 2 3 0-15 W_(i) ₁ ,_(i) ₁ _(,0) ⁽²⁾ W_(i) ₁ _(,i) ₁ _(,1) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+8,0) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+8,1) ⁽²⁾ i₂ i₁ 4 5 6 7 0-15 W_(i) ₁ _(+16,i) ₁ _(+16,0) ⁽²⁾ W_(i) ₁ _(+16,i) ₁ _(+16,1) ⁽²⁾ W_(i) ₁ _(+24,i) ₁ _(+24,0) ⁽²⁾ W_(i) ₁ _(+24,i) ₁ _(+24,1) ⁽²⁾ i₂ i₁ 8 9 10 11 0-15 W_(i) ₁ _(,i) ₁ _(+8,0) ⁽²⁾ W_(i) ₁ _(,i) ₁ _(+8,1) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+16,0) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+16,1) ⁽²⁾ i₂ i₁ 12 13 14 15 0-15 W_(i) ₁ _(,i) ₁ _(+24,0) ⁽²⁾ W_(i) ₁ ,_(i) ₁ _(+24,1) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+24,0) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+24,1) ⁽²⁾ ${{where}\mspace{14mu} W_{m,m^{\prime},n}^{(2)}} = {\frac{1}{\sqrt{8}}\begin{bmatrix} v_{m}^{\prime} & v_{m^{\prime}}^{\prime} \\ {\phi_{n}v_{m}^{\prime}} & {{- \phi_{n}}v_{m^{\prime}}^{\prime}} \end{bmatrix}}$

φ_(n) =e ^(jπn/2) v′ _(m)=[1e ^(j2πm/32)]^(T) where W=W_(m,m′,n) ⁽²⁾.
 44. A method of channel state information (CSI) feedback in a wireless communication system, node comprising: receiving one or more precoding matrix Indicator (PMI) signals from a remote transceiver; and generating a precoding matrix W derived from a matrix multiplication of two matrices W₁ and W₂, where said precoding matrix W Is applicable to precoding one or more layers of data streams, matrix W₁ is selected from a first codebook using a PMI value i₁, and matrix W₂ is selected from a second codebook using a PMI value i₂ where the first matrix is selected according to $W_{1}^{(i_{1})} = \begin{bmatrix} X^{(i_{1})} & 0 \\ 0 & X^{(i_{1})} \end{bmatrix}$ for i₁=0, 1, . . . , 15 with X ^((k)) =[b _(k mod 32) b _((k+8)mod 32) b _((k+16)mod 32) b _((k+24)mod 32)] b ₂ =v′ _(k) v′ _(k)=[1e ^(j2πk/32)]^(T).
 45. The method of claim 44, wherein the number of layers of the data stream is one, and wherein the second precoder matrix is selected according to $W_{2}^{(i_{2})} = {\frac{1}{2}\begin{bmatrix} {\overset{\sim}{e}}_{1 + {\lbrack{i_{2}/4}\rbrack}} \\ {\phi_{{2{\lbrack{i_{2}/4}\rbrack}} + {8{({i_{2}\mspace{14mu} {mod}\mspace{14mu} 4})}}}^{\prime}{\overset{\sim}{e}}_{1 + {\lbrack{i_{2}/4}\rbrack}}} \end{bmatrix}}$ for i ₂=0,1, . . . ,15 where φ′_(n) =e ^(j2πn/32) and {tilde over (e)}_(i) is a 4×1 vector with all zero entries except for the i-th element which has value
 1. 46. The method of claim 44, wherein the number of layers of the data stream is one, and wherein the precoding matrix W is chosen as a function of the two PMI values i₁ and i₂ according to i₂ i₁ 0 1 2 3 4 5 6 7 0-15 W_(i) ₁ ,₀ ⁽¹⁾ W_(i) ₁ _(,8) ⁽¹⁾ W_(i) ₁ _(,16) ⁽¹⁾ W_(i) ₁ _(,24) ⁽¹⁾ W_(i) ₁ _(+8,2) ⁽¹⁾ W_(i) ₁ _(+8,10) ⁽¹⁾ W_(i) ₁ _(+8,18) ⁽¹⁾ W_(i) ₁ _(+8,26) ⁽¹⁾ i₂ i₁ 8 9 10 11 12 13 14 15 0-15 W_(i) ₁ _(+16,4) ⁽¹⁾ W_(i) ₁ _(+16,12) ⁽¹⁾ W_(i) ₁ _(+16,20) ⁽¹⁾ W_(i) ₁ _(+16,24) ⁽¹⁾ W_(i) ₁ _(+24,0) ⁽¹⁾ W_(i) ₁ _(+24,14) ⁽¹⁾ W_(i) ₁ _(+24,22) ⁽¹⁾ W_(i) ₁ _(+24,30) ⁽¹⁾ ${{where}\mspace{14mu} W_{m,n}^{(1)}} = {\frac{1}{2}\begin{bmatrix} v_{m}^{\prime} \\ {\phi_{n}^{\prime}v_{m}^{\prime}} \end{bmatrix}}$

φ_(n) =e ^(jπn/32) v′ _(m)=[1e ^(j2πm/32)]^(T) where W=W_(m,n) ⁽¹⁾.
 47. The method of claim 44, wherein the number of layers of the data stream is two, and wherein the second precoder matrix is selected according to $W_{2}^{(i_{2})} = \left\{ \begin{matrix} \frac{1}{\sqrt{8}} & \left\lbrack \begin{matrix} {\overset{\sim}{e}}_{1 + {\lbrack{i_{2}/2}\rbrack}} \\ {^{j\; {{x{({i_{2}\mspace{14mu} {mod}\mspace{14mu} 2})}}/2}}{\overset{\sim}{e}}_{1 + {\lbrack{i_{2}/2}\rbrack}}} \end{matrix} \right. & {\left. \begin{matrix} {\overset{\sim}{e}}_{1 + {\lbrack{i_{2}/2}\rbrack}} \\ {- ^{j\; {{x{({i_{2}\mspace{14mu} {mod}\mspace{14mu} 2})}}/2}}} \\ {\overset{\sim}{e}}_{1 + {\lbrack{i_{2}/2}\rbrack}} \end{matrix} \right\rbrack,{{{if}\mspace{14mu} 0} \leq i_{2} \leq 7},} \\ \frac{1}{\sqrt{8}} & \left\lbrack \begin{matrix} {\overset{\sim}{e}}_{1 + {\lbrack{{({i_{2} - 8})}/2}\rbrack}} \\ {^{j\; {{x{({i_{2}\mspace{14mu} {mod}\mspace{14mu} 2})}}/2}}{\overset{\sim}{e}}_{1 + {\lbrack{{({i_{2} - 8})}/2}\rbrack}}} \end{matrix} \right. & {\left. \begin{matrix} {\overset{\sim}{e}}_{2 + {\lbrack{{({i_{2} - 8})}/2}\rbrack}} \\ {- ^{j\; {{x{({i_{2}\mspace{14mu} {mod}{\mspace{11mu} \;}2})}}/2}}} \\ {\overset{\sim}{e}}_{2 + {\lbrack{{({i_{2} - 8})}/2}\rbrack}} \end{matrix} \right\rbrack,{{{if}\mspace{14mu} 8} \leq i_{2} \leq 11},} \\ \frac{1}{\sqrt{8}} & \left\lbrack \begin{matrix} {\overset{\sim}{e}}_{1 + {\lbrack{{({i_{2} - 12})}/2}\rbrack}} \\ {^{j\; {{x{({i_{2}{\mspace{11mu} \;}{mod}\mspace{14mu} 2})}}/2}}{\overset{\sim}{e}}_{1 + {\lbrack{{({i_{2} - 12})}/2}\rbrack}}} \end{matrix} \right. & {\left. \begin{matrix} {\overset{\sim}{e}}_{4} \\ {{- ^{j\; {{x{({i_{2}\mspace{14mu} {mod}\mspace{14mu} 2})}}/2}}}{\overset{\sim}{e}}_{4}} \end{matrix} \right\rbrack,{{{if}\mspace{14mu} 12} \leq i_{2} \leq 15.}} \end{matrix} \right.$ where {tilde over (e)}_(i) is a 4×1 vector with all zero entries except for the i-th element which has value
 1. 48. The method of claim 44, wherein the number of layers of the data stream is two, and wherein the precoding matrix W is chosen as a function of the two PMI values i₁ and i₂ according to i₂ i₁ 0 1 2 3 0-15 W_(i) ₁ ,_(i) ₁ _(,0) ⁽²⁾ W_(i) ₁ _(,i) ₁ _(,1) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+8,0) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+8,1) ⁽²⁾ i₂ i₁ 4 5 6 7 0-15 W_(i) ₁ _(+16,i) ₁ _(+16,0) ⁽²⁾ W_(i) ₁ _(+16,i) ₁ _(+16,1) ⁽²⁾ W_(i) ₁ _(+24,i) ₁ _(+24,0) ⁽²⁾ W_(i) ₁ _(+24,i) ₁ _(+24,1) ⁽²⁾ i₂ i₁ 8 9 10 11 0-15 W_(i) ₁ _(,i) ₁ _(+8,0) ⁽²⁾ W_(i) ₁ _(,i) ₁ _(+8,1) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+16,0) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+16,1) ⁽²⁾ i₂ i₁ 12 13 14 15 0-15 W_(i) ₁ _(,i) ₁ _(+24,0) ⁽²⁾ W_(i) ₁ _(,i) ₁ _(+24,1) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+24,0) ⁽²⁾ W_(i) ₁ _(+8,i) ₁ _(+24,1) ⁽²⁾ ${{where}\mspace{14mu} W_{m,m^{\prime},n}^{(2)}} = {\frac{1}{\sqrt{8}}\begin{bmatrix} v_{m}^{\prime} & v_{m^{\prime}}^{\prime} \\ {\phi_{n}v_{m}^{\prime}} & {{- \phi_{n}}v_{m^{\prime}}^{\prime}} \end{bmatrix}}$

φ_(n) =e ^(jπn/2) v′ _(m)=[1e ^(j2πm/32)]^(T) where W=W_(m,m′,n) ⁽²⁾. 